View source for Sum of even indexed Fibonacci numbers

← Sum of even indexed Fibonacci numbers

Jump to: navigation, search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

==Theorem==
The following formula holds:
$$\displaystyle\sum_{k=1}^n F_{2k} = F_{2n+1}-1,$$
where $F_{2k}$ denotes the $2k$th [[Fibonacci numbers|Fibonacci number]].

==Proof==

==References==

[[Category:Theorem]]
[[Category:Unproven]]

Return to Sum of even indexed Fibonacci numbers.

Retrieved from "http://specialfunctionswiki.org/index.php/Sum_of_even_indexed_Fibonacci_numbers"