Difference between revisions of "Fibonacci numbers"
From specialfunctionswiki
(→Properties) |
|||
| Line 7: | Line 7: | ||
[[Binet's formula]]<br /> | [[Binet's formula]]<br /> | ||
[[Sum of Fibonacci numbers]]<br /> | [[Sum of Fibonacci numbers]]<br /> | ||
| + | [[Sum of odd Fibonacci numbers]]<br /> | ||
=Videos= | =Videos= | ||
Revision as of 02:22, 15 September 2016
The Fibonacci sequence numbers $F_n$ are defined by the recurrence $$F_{n+2}=F_n+F_{n+1}, \quad F(0)=0, F(1)=1.$$
Properties
Limit of quotient of consecutive Fibonacci numbers
Binet's formula
Sum of Fibonacci numbers
Sum of odd Fibonacci numbers
Videos
The Golden Ratio & Fibonacci Numbers: Fact versus Fiction
Doodling in Math: Spirals, Fibonacci, and Being a Plant (1 of 3)
Fibonacci mystery
See also
Fibonacci zeta function
Golden ratio
Reciprocal Fibonacci constant
Lucas numbers
External links
The Fibonacci Quarterly
"What interesting properties of the Fibonacci sequence can I share when introducing sequences?"
