19990401
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)d (an+2=)
3 4(n. an ··)d(an+1)+2(an)w
4 5(RANG)2(a1)bwgwbwbwi
5 6(TABL)
Result Screen
5-9-2
Graphing a Recursion Formula
#Specifying On for the Σ Display of the SET UP
screen causes the sum of each term to be
included in the table.
* The first two values correspond to
a1 = 1 and a2 = 1.
20011101
To Next Page
Loading...
