Texas Instruments TI-84 PLUS - Graphing Calculator Manual Book page 112

Nonrecursive Sequences
In a nonrecursive sequence, the
independent of all other terms.
For example, in the nonrecursive sequence below, you can calculate
calculating or any previous term.
u(1)
The sequence equation above returns the sequence 2, 4, 6, 8, 10, ... for n = 1, 2, 3, 4, 5, ... .
You may leave blank the initial value
Note:
Recursive Sequences
In a recursive sequence, the
the term that precedes the previous term, represented by
may also be defined in relation to
For example, in the sequence below you cannot calculate
, and .
u(3) u(4)
Using an initial value
u(nMin) = 1
On the TI-84 Plus, you must type each character of the terms. For example, to enter
Note:
press y £ „ ¹ À ¤.
[u]
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
specify an initial value for the first term.
th term is a function of the independent variable
n
when calculating nonrecursive sequences.
u(nMin)
th term in the sequence is defined in relation to the previous term or
n
, as in
n u(n)=u(n N 1)+n.
, the sequence above returns 1, 2, 4, 8, 16, ... .
directly, without first
u(5)
and . A recursive sequence
u(n N 1) u(n N 2)
without first calculating
u(5)
Chapter 6: Sequence Graphing
. Each term is
n
, ,
u(1) u(2)
,
u(n 1)
N
, you must
u(n N 1)
105