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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
