2019
DOI: 10.3390/math7070638
|View full text |Cite
|
Sign up to set email alerts
|

On the Sum of Reciprocal of Polynomial Applied to Higher Order Recurrences

Abstract: Recently a lot of papers have been devoted to partial infinite reciprocal sums of a higher-order linear recursive sequence. In this paper, we continue this program by finding a sequence which is asymptotically equivalent to partial infinite sums, including a reciprocal of polynomial applied to linear higher order recurrences.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…For more the nearest integer of the sums of reciprocal of the recurrence sequence studies, see [18][19][20][21]. Specifically, in [19], Trojorský considered finding a sequence that is "asymptotically equivalent" to partial infinite sums and proved that…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For more the nearest integer of the sums of reciprocal of the recurrence sequence studies, see [18][19][20][21]. Specifically, in [19], Trojorský considered finding a sequence that is "asymptotically equivalent" to partial infinite sums and proved that…”
Section: Introductionmentioning
confidence: 99%
“…Inspired by [19], in this paper, we apply a different research method from the previous one and use the properties of error estimation and the analytic method to study the reciprocal products of {f n }, {l n } and {u n }. We derive some sequences that are asymptotically equivalent to reciprocal products including {f n }, {l n } and {u n }.…”
Section: Introductionmentioning
confidence: 99%
“…• Evaluations of reciprocal sums of Pell and Lucas polynomials as well as their extensions (see Wu-Zhang [14] and Trojovský [15]). • Combinatorial interpretations by arranging the Pell numbers on the vertices of polygons (see Celik-Durukan-Özkan [16]) and by counting restricted set partitions (see Mansour and Shattuck [17]).…”
mentioning
confidence: 99%