Sum of odd indexed Fibonacci numbers

From specialfunctionswiki
Revision as of 02:23, 15 September 2016 by Tom (talk | contribs) (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...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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

References