Iterated Partial Sums of the k-Fibonacci Sequences

Abstract

In this paper, we find the sequence of partial sums of the k-Fibonacci sequence, say, Sk,n=∑j=1nFk,j, and then we find the sequence of partial sums of this new sequence, Sk,n2)=∑j=1nSk,j, and so on. The iterated partial sums of k-Fibonacci numbers are given as a function of k-Fibonacci numbers, in powers of k, and in a recursive way. We finish the topic by indicating a formula to find the first terms of these sequences from the k-Fibonacci numbers themselves.