Answers are grounded in this paper and cite their sources.
In this paper, we define some properties of sums of k-Fibonacci numbers. Also we present the sum of consecutive members of k-Fibonacci numbers and the same thing for even and for odd k-Fibonacci numbers. Mainly, Binet's formula will be used to establish properties of k-Fibonacci numbers.
No takes yet. Share an insight, caveat, or question.
Panwar et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: