Casio ALGEBRA FX 2.0 PLUS Graphing - Manual (Page 63)

19990401
○ ○ ○ ○ ○
Example Generate a number table from recursion between three terms as
expressed by
a
n + 2
= a
n + 1
+ a
n , with initial terms of a
1
= 1, a
2
= 1
(Fibonacci sequence), as n changes in value from 1 to 6.
Procedure
1 m RECUR
2 3(TYPE)d( a
n + 2
=)
3 4( n . a
n ·· )d( a
n + 1
)+2( a
n )w
4 5(RANG)2( a
1
)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
a
1
= 1 and a
2
= 1.
20011101