Question: In F0, F1, F2,... is the Fibonacci sequence
Use the recurrence relation and values for F0, F1, F2,... given in Example to compute F13 and F14.
Example: The Fibonacci Numbers
One of the earliest examples of a recursively defined sequence arises in the writings of Leonardo of Pisa, commonly known as Fibonacci, who was the greatest European mathematician of the Middle Ages. In 1202 Fibonacci posed the following problem: A single pair of rabbits (male and female) is born at the beginning of a year. Assume the following conditions:
1. Rabbit pairs are not fertile during their first month of life but thereafter give birth to one new male/female pair at the end of every month.
2. No rabbits die.
How many rabbits will there be at the end of the year?