Recursive definition of the Fibonacci numbers
In some recursive definitions, the value of the function is directly
specified not only for 0, but for the first k nonnegative integers.
The Fibonacci numbers are F(0), F(1), F(2), …, where F is defined
- F(n) = F(n-1) + F(n-2) (for n?2)