Casio fx-9860G Series User Manual page 243

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