Difference between revisions of "Sum of odd indexed Fibonacci numbers"
From specialfunctionswiki
(Created page with "==Theorem== The following formula holds: $$\displaystyle\sum_{k=1}^n F_{2k+1} = F_{2n+2},$$ where $F_{2k+1}$ denotes a Fibonacci number. ==Proof== ==R...") |
m (Tom moved page Sum of odd Fibonacci numbers to Sum of odd indexed Fibonacci numbers) |
(No difference)
| |
Revision as of 02:24, 15 September 2016
Theorem
The following formula holds: $$\displaystyle\sum_{k=1}^n F_{2k+1} = F_{2n+2},$$ where $F_{2k+1}$ denotes a Fibonacci number.
