Probabilistic approaches to exploring Binet's type formula for the Tribonacci sequence
AIMS Mathematics · 2025 · 10 (5) · 11957-11975
DOI: 10.3934/math.2025540 ↗At a glance
Journal article in AIMS Mathematics, 2025. Written by Skander Hachicha and 1 co-authors. Cited 3 times so far (Crossref); 31 references.
Abstract (original language)
: This paper presents a detailed procedure for deriving a Binet’s type formula for the Tribonacci sequence { T n } . We examine the limiting distribution of a Markov chain that encapsulates the entire sequence { T n } , offering insights into its asymptotic behavior. An approximation of T n is provided using two distinct probabilistic approaches. Furthermore, we study random sequences of the form { Z 0 , Z 1 , Z 2 , Z n = Z n − 3 + Z n − 2 + Z n − 1 , n = 3 , . . . } , referred to as the Tribonacci sequence of Random Variables. These sequences, fully defined by their initial random variables, are analyzed in terms of their distributional and limiting properties.
Cite
APA
Hachicha, S., & Attia, N. (2025). Probabilistic approaches to exploring Binet's type formula for the Tribonacci sequence. AIMS Mathematics, 10(5), 11957-11975. https://doi.org/10.3934/math.2025540
Vancouver
Hachicha S, Attia N. Probabilistic approaches to exploring Binet's type formula for the Tribonacci sequence. AIMS Mathematics. 2025;10(5):11957-11975. doi:10.3934/math.2025540
BibTeX
@article{Hachicha2025,
author = {Hachicha, Skander and Attia, Najmeddine},
title = {Probabilistic approaches to exploring Binet's type formula for the Tribonacci sequence},
journal = {AIMS Mathematics},
year = {2025},
volume = {10},
number = {5},
pages = {11957--11975},
doi = {10.3934/math.2025540}
}
EUVIMED