Filter
Top Products
20050401
Example Generate a number table from recursion between three terms as
expressed by
an+2 = an+1 + an, with initial terms of a1 = 1, a2 = 1
(Fibonacci sequence), as n changes in value from 1 to 6.
Procedure
1 m RECUR
2 3(TYPE)3(an+2)
3 4(n. an ··)3(an+1)+2(an)w
4 5(SET)2(a1)bwgwbwbwJ
5 6(TABL)
Result Screen
5-9-2
Graphing a Recursion Formula
#Pressing 1(FORM) will return to the screen
for storing recursion formulas.
* The first two values correspond to
a1 = 1 and a2 = 1.
# Specifying On for the Σ Display of the Setup
screen causes the sum of each term to be
included in the table.