Operation Manual

TI-83 Plus Sequence Graphing 183

For example, in the nonrecursive sequence below, you can calculate

u(5)

directly, without first calculating

u(1)

or any previous term.

The sequence equation above returns the sequence

, …for

… .

Note: You may leave blank the initial value

u(nMin)

when calculating

nonrecursive sequences.

Recursive Sequences

In a recursive sequence, the

th term in the sequence is defined in

relation to the previous term or the term that precedes the previous term,

represented by

and

. A recursive sequence may also be

defined in relation to

, as in

)=u(

1)+

For example, in the sequence below you cannot calculate

u(5)

without

first calculating

u(1)

u(2)

u(3)

, and

u(4)