Summation over k to n of Product of kth with n-kth Fibonacci Numbers

Theorem

 * $\displaystyle \sum_{k \mathop = 0}^n F_k F_{n - k} = \dfrac {\left({n - 1}\right) F_n + 2n F_{n - 1} } 5$

where $F_n$ denotes the $n$th Fibonacci number.

Proof
From Generating Function for Fibonacci Numbers, a generating function for the Fibonacci numbers is:


 * $G \left({z}\right) = \dfrac z {1 - z - z^2}$

Then:

where:
 * $\phi = \dfrac {1 + \sqrt 5} 2$
 * $\hat \phi = \dfrac {1 - \sqrt 5} 2$

Hence:

Thus the coefficient of $z^n$ in $\left({G \left({z}\right)}\right)^2$ is $\displaystyle \sum_{k \mathop = 0}^n F_k F_{n - k}$.

Hence: