Nonrecursive sequences – Texas Instruments TI-84 User Manual
Page 160
Chapter 6: Sequence Graphing
157
•
To enter the function name
u
, press
y
[u]
(above
¬).
•
To enter the function name
v
, press
y
[v]
(above
−).
•
To enter the function name
w
, press
y
[w]
(above
®).
Generally, sequences are either nonrecursive or recursive. Sequences are evaluated
only at consecutive integer values.
n
is always a series of consecutive integers, starting
at zero or any positive integer.
Nonrecursive Sequences
Nonrecursive Sequences
Nonrecursive Sequences
Nonrecursive Sequences
In a nonrecursive sequence, the
n
th term is a function of the independent variable
n
.
Each term is independent of all other terms.
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 2, 4, 6, 8, 10, … for
n = 1, 2, 3, 4, 5, … .
Note:
You may leave blank the initial value
u(nMin)
when calculating nonrecursive
sequences.