SEQUENCES Evaluating A Sequence (Page 10 of 11)

As a second example of a recursive sequence, let's find the first ten terms of the Fibonacci sequence defined by
 a(subscript 1) = 1, a(subscript 2) = 1, a(subscript n) = a(subscript n-1)+a(subscript n-2). First define the sequence as u in the sequence editor. Be sure nMin = 1, then define the rule for the sequence on the next line. Enter a(subscript n-1) as u(n-1) and a(subscript n-2) as u(n-2). For u(nMin), we must specify both the first and second terms of the sequence. We do this using braces and listing the two terms separated by a comma.

 Y= key. (Clear the previous functions)

 2nd u key. Left parenthesis key. X,T,theta,n key. Minus key. 1 Right parenthesis key. Plus key. 2nd u key. Left parenthesis key. X,T,theta,n key.
 Minus key. 2 Right parenthesis key. ENTER key.

 2nd Left brace key. 1 Comma key. 1 2nd Right brace key.

 Calculator screen image.
Copyright © 2010 Turner Educational Publishing
Go back to the previous page. Go to the next page. Go to the Table of Contents. Go to the Index page. Go to the Quiz page. Exit to the Home page.