Recursive Sequences - Texas Instruments TI-83 Manual Book

For example, in the nonrecursive sequence below, you can calculate
u(5)
directly, without first calculating or any previous term.
u(1)
The sequence equation above returns the sequence , , , , , ...for
2 4 6 8 10
= , , , , ,
n
1 2 3 4 5
... .
Note: You may leave blank the initial value when calculating
u(nMin)
nonrecursive sequences.

Recursive Sequences

In a recursive sequence, the th term in the sequence is defined in
n
relation to the previous term or the term that precedes the previous term,
represented by and . A recursive sequence may also be
u( n N1) u( n N2)
defined in relation to , as in
u( n )=u( n N1)+ n .
n
For example, in the sequence below you cannot calculate without
u(5)
first calculating , , , and .
u(1) u(2) u(3) u(4)
TI-83 Plus Sequence Graphing 183