Sum of odd indexed Fibonacci numbers

From specialfunctionswiki
Revision as of 00:29, 24 May 2017 by Tom (talk | contribs)
(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 the $2k+1$st Fibonacci number.

Proof

References