A series of whole numbers in which each number is the sum of the two preceding numbers. Beginning with 0 and 1, the sequence of Fibonacci numbers would be 0,1,1, 2, 3, 5, 8, 13, 21, 34, etc. using the formula n = n(1) + n(2), where the n(1) means "the last number before n in the series" and n(2) refers to "the second last one before n in the series.”
In computer programming, Fibonacci numbers give a model for designing recursive programming algorithms where the time for any routine is the time within the routine itself, plus the time for the recursive calls.
The Fibonacci numbers were originally defined by the Italian mathematician Fibonacci, also known as Leonardo da Pisa, in the 13th century to model the growth of rabbit populations.

•Email this definition to a colleague•
Fibonacci Numbers and the Golden Section This is the Home page for Ron Knott's Surrey University multimedia Web site on the Fibonacci numbers, the Golden section and the Golden string.
The FibPhi Link Page Links to Internet sites on the applications of Fibonacci numbers in various fields of study.
The Mathematical Magic of the Fibonacci Numbers This page looks at some patterns in the Fibonacci numbers themselves, from the digits in the numbers to their factors and multiples and which are prime numbers

