User:Graeme McRae

Graeme is a long time seqfan mailing list member, and contributor of some sequences.

Sum of m Consecutive Fibonacci Numbers

From Graeme McRae Apr 24 2014: For n>m, the sum of the 2m consecutive Fibonacci numbers F(n-m-1) thru F(n+m-2) is F(n)*L(m) if m is odd, and L(n)*F(m) if m is even. Proof is Sum of m Consecutive Fibonacci Numbers