5-9-2

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 RECUR23(TYPE)3(an+2)34(n. an ··)3(an+1)+2(an)w45(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

# Specifying On for the Σ Display of the Setup

 

 

 

 

for storing recursion formulas.

screen causes the sum of each term to be

 

 

 

included in the table.

 

 

 

 

20070201