Casio Algebra FX 2.0 PLUS User Manual page 215

Example Generate a number table from recursion between three terms as
expressed by
(Fibonacci sequence), as
Procedure
1 m RECUR
a
2 3(TYPE)d(
n a a
. )d(
3 4(
n ··
a
4 5(RANG)2(
5 6(TABL)
Result Screen
# Specifying On for the Σ Display of the SET UP
screen causes the sum of each term to be
included in the table.
5-9-2
Graphing a Recursion Formula
a a
= +
n +
n+
2 1
n
=)
n+
2
a
)+2( )w
n+ 1 n
)bwgwbwbwi
1
* The first two values correspond to
a a
= 1 and = 1.
1 2
20011101 19990401
a
, with initial terms of
n
changes in value from 1 to 6.
a a
= 1, = 1
1 2