Tutorial by Topics: fibonacci



Fibonacci Numbers is the integer sequence (OEIS A000045) F(n) that obeys the following recurrence:

F(n) = F(n-1) + F(n-2)

For F(0) = 0, F(1) = 1, the series thus formed is 0, 1, 1, 2, 3, 5, 8, 13, 21, ...

Fibonacci numbers appear in several areas of Discrete Mathematics and Algorithms.


Page 1 of 1