Texas Instruments TI-82 STATS Manual Book page 124

Defining and Displaying Sequence Graphs
Recursive
Sequences
6–6 Sequence Graphing
In a recursive sequence, the
in relation to the previous term or the term that precedes the
previous term, represented by
sequence may also be defined in relation to
u(n)=u(nN1)+n.
For example, in the sequence below you cannot calculate
without first calculating
Using an initial value
, , , , , . . .
1 2 4 8 16
Tip: On the TI-82 STATS, you must type each character of the terms.
For example, to enter
Recursive sequences require an initial value or values, since
they reference undefined terms.
If each term in the sequence is defined in relation to the
previous term, as in
for the first term.
If each term in the sequence is defined in relation to the term
that precedes the previous term, as in
specify initial values for the first two terms. Enter the initial
values as a list enclosed in braces ({ }) with commas
separating the values.
The value of the first term is 0 and the value of the second term
is 1 for the sequence
th term in the sequence is defined
n
and
u(nN1)
, , , and
u(1) u(2) u(3)
, the sequence above returns
u(nMin) = 1
, press y [ ] £ „ ¹ À ¤.
u(nN1)
u
, you must specify an initial value
u(nN1)
.
u(n)
(continued)
. A recursive
u(nN2)
, as in
n
u(5)
.
u(4)
, you must
u(nN2)