The Fibonacci series 0, 1, 1, 2, 3, 5, 8, 13, in which each number is the sum of the two previous, is defined as F(0)=0, F(1)=1, and F(n)=F(n1)+F(n2) for n>1.
What is the sum of F(0)+F(1)+F(2)+...+F(k)?
What is the sum of F(0)^2+F(1)^2+F(2)^2+...+F(k)^2?
(In reply to
Inelegant solution by Bryan)
For the latter question F(k) * F(k+1) seems to work regardless of odd or even k.

Posted by Charlie
on 20040715 15:35:57 