PARTIAL SUMS OF THE FIBONACCI SEQUENCE

Let (F-n)(n >= 1) be the Fibonacci sequence. Define P(F-n) = (Sigma(n)(i=1) F-i)(n >= 1); that is, the function P gives the sequence of partial sums of (F-n). In this paper, we first give an identity involving P-k (F-n), which is the resulting sequence by applying P to (F-n) k times. Second, we provide a combinatorial interpretation of the numbers in P-k (F-n).