Let a = c 1 1 1 0 d For n 1, let F(n) equal the nth value
Chapter 5, Problem 23(choose chapter or problem)
Let a = c 1 1 1 0 d For n 1, let F(n) equal the nth value in the Fibonacci sequence (see Example 2 in Chapter 3); let F(0) = 0. Prove that for any n 1, an is given by c F(n + 1) F(n) F(n) F(n 1) d
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer