Generalizations Of Fibonacci Numbers
In mathematics, the Fibonacci numbers form a sequence defined recursively by:
- F(0) = 0
- F(1) = 1
- F(n) = F(n-1) + F(n-2), for integer n > 1.
That is, after two starting values, each number is the sum of the two preceding numbers.
The Fibonacci sequence has been studied extensively and generalized in many ways, for example, by starting with other numbers than 0 and 1, by adding more than two numbers to generate the next number, or by adding objects other than numbers.
Read more about Generalizations Of Fibonacci Numbers: Extension To Negative Integers, Extension To All Real or Complex Numbers, Vector Space, Fibonacci Word, Convolved Fibonacci Sequences, Other Generalizations
Famous quotes containing the word numbers:
“Our religion vulgarly stands on numbers of believers. Whenever the appeal is made—no matter how indirectly—to numbers, proclamation is then and there made, that religion is not. He that finds God a sweet, enveloping presence, who shall dare to come in?”
—Ralph Waldo Emerson (1803–1882)