Graphing a Recursion Formula
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
1m RECUR
23(TYPE)3(an+2)
34(n. an ··)3(an+1)+2(an)w
45(SET)2(a1)bwgwbwbwJ
56(TABL)
Result Screen
*The first two values correspond to a1 = 1 and a2 = 1.
#Pressing 1(FORM) will return to the screen for storing recursion formulas.
#Specifying On for the Σ Display of the Setup screen causes the sum of each term to be included in the table.
20050401