A Unified Explicit Binet Formula for 3rd-Order Linear Recurrence Relations
Advances in Analysis and Applied Mathematics · 2024
DOI: 10.62298/advmath.11 ↗Kurz gefasst
Fachartikel in der Zeitschrift Advances in Analysis and Applied Mathematics, 2024. Verfasst von Kishori Lal Verma. Der Volltext ist frei zugänglich (Open Access, CC BY 3.0).
Abstract (Originalsprache)
In this paper, third order generalized linear recurrence relation Vn (aj , pj) = p1Vn−1 + p2Vn−2 + p3Vn−3, p3 ≠ 0, is studied to generate a generalized Tribonacci sequence, where pj , Vj = aj are arbitrary integers. Generalized generating function for the 3rd order general tribonacci sequence is derived, and then new unified explicit generalized Binet formulas is obtained. This formula is then compared with existing ones. Furthermore, by imposing specific constraints on the initial terms and coefficients of the recurrence relation, the formula is specialized to the Fibonacci sequence and other Fibonacci-like sequences by appropriately selecting pj , Vj = aj.
Zitieren
APA
Verma, K. L. (2024). A Unified Explicit Binet Formula for 3rd-Order Linear Recurrence Relations. Advances in Analysis and Applied Mathematics. https://doi.org/10.62298/advmath.11
Vancouver
Verma KL. A Unified Explicit Binet Formula for 3rd-Order Linear Recurrence Relations. Advances in Analysis and Applied Mathematics. 2024. doi:10.62298/advmath.11
BibTeX
@article{Verma2024,
author = {Verma, Kishori Lal},
title = {A Unified Explicit Binet Formula for 3rd-Order Linear Recurrence Relations},
journal = {Advances in Analysis and Applied Mathematics},
year = {2024},
doi = {10.62298/advmath.11}
}
EUVIMED