AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (541.4 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

The asymptotic behavior of the reciprocal sum of generalized Fibonacci numbers

Hongjian Li1Kaili Yang2( )Pingzhi Yuan2
School of Mathematics and Statistics, Guangdong University of Foreign Studies, Guangzhou 510006, China
School of Mathematical Sciences, South China Normal University, Guangzhou 510631, China
Show Author Information

Abstract

Let ( u n ) n 0 be the special Lucas u-sequence defined by

u n + 2 = A u n + 1 B u n , u 0 = 0 , u 1 = 1 ,

where n 0, B = ± 1, and A is an integer such that A 2 4 B > 0. Let

a k = 1 u m k s , 1 u m k + u m k + l , 1 i = 0 l u m k + i , 1 u m k u m k + 2 l , 1 u m k u m k + 2 l 1 , 1 u m k + C ,

where m , l are positive integers, s = 1 , 2 , 3 , 4, and C is any constant. The aim of this paper is to find a form g n such that

lim n ( ( k = n a k ) 1 g n ) = 0.

For example, we show that

lim n ( ( k = n 1 u m k ) 1 ( u m n u m ( n 1 ) ) ) = 0.

References

【1】
【1】
 
 
Electronic Research Archive
Pages 409-432

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Li H, Yang K, Yuan P. The asymptotic behavior of the reciprocal sum of generalized Fibonacci numbers. Electronic Research Archive, 2025, 33(1): 409-432. https://doi.org/10.3934/era.2025020

1

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 15 October 2024
Revised: 31 December 2024
Accepted: 15 January 2025
Published: 15 January 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)