Difference between revisions of "Sum of even indexed Fibonacci numbers"

From specialfunctionswiki
Jump to: navigation, search
(Created page with "==Theorem== The following formula holds: $$\displaystyle\sum_{k=1}^n F_{2k} = F_{2n+1}-1,$$ where $F_{2k}$ denotes a Fibonacci number. ==Proof== ==Ref...")
(No difference)

Revision as of 02:25, 15 September 2016

Theorem

The following formula holds: $$\displaystyle\sum_{k=1}^n F_{2k} = F_{2n+1}-1,$$ where $F_{2k}$ denotes a Fibonacci number.

Proof

References