Recurrence Relation for Sequence of mth Powers of Fibonacci Numbers/Lemma 1

Theorem

$\ds \sum_{k \mathop \in \Z} \dbinom m k_\FF \paren {-1}^{\ceiling {\paren {m - k} / 2} } {F_{n + k} }^{m - 2} F_k = F_m \sum_{k \mathop \in \Z} \dbinom {m - 1} {k - 1}_\FF \paren {-1}^{\ceiling {\paren {m - k} / 2} } {F_{n + k} }^{m - 2} = 0$

where:

$\dbinom m k_\FF$ denotes a Fibonomial coefficient

$F_{n + k}$ denotes the $n + k$th Fibonacci number

$\ceiling {\, \cdot \,}$ denotes the ceiling function

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Sources

• 1997: Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (3rd ed.) ... (previous) ... (next): $\S 1.2.8$: Fibonacci Numbers: Exercise $30$: Solution: $\text{(a)}$