Recounting the sums of cubes of Fibonacci numbers (Q2883383)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recounting the sums of cubes of Fibonacci numbers |
scientific article; zbMATH DE number 6032393
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recounting the sums of cubes of Fibonacci numbers |
scientific article; zbMATH DE number 6032393 |
Statements
10 May 2012
0 references
Recounting the sums of cubes of Fibonacci numbers (English)
0 references
Let \(\{F_i \}_{i \geq 1}\) be a Fibonacci sequence and let \(f_n = F_{n+1}.\) A simple combinatorial proof of the identity NEWLINE\[NEWLINE\sum_{k=0}^n f_k^3 = \frac{f_{3n+4}+(-1)^n6f_{n-1}+5}{10}NEWLINE\]NEWLINE is given, and some of its applications are discussed.
0 references
0.806256890296936
0 references
