A note on the sums of reciprocal k-Fibonacci numbers of subscript
DOI:
https://doi.org/10.24297/jam.v9i1.2463Keywords:
Binet Identity, Lucas numbers, Fibonacci numbersAbstract
In this article we find the fïnite sum of reciprocal k-Fibonacci numbers of subscript 2n a, then we fïnd the infinite sum of these numbers. Special cases of these sums for the classical Fibonacci sequence and the Pell sequence are indicated. Finally we propose a new way to fïnd the infinite sum of the reciprocal k-Fibonacci numbers with odd subscripts and, consequently, the sum of all reciprocal k-Fibonacci numbers, but without finding the answer to this problem (Erdos).
Downloads
Downloads
Published
How to Cite
Issue
Section
License
All articles published in Journal of Advances in Linguistics are licensed under a Creative Commons Attribution 4.0 International License.