Mustapha Rachidi, László Szalay and Fatih Yilmaz
Notes on Number Theory and Discrete Mathematics
Print ISSN 1310–5132, Online ISSN 2367–8275
Volume 31, 2025, Number 2, Pages 311–325
DOI: 10.7546/nntdm.2025.31.2.311-325
Full paper (PDF, 197 Kb)
Details
Authors and affiliations
Mustapha Rachidi
Instituto de Matemática INMA, Federal University of Mato Grosso do Sul
Campo Grande – MS, Brazil
László Szalay
Department of Mathematics, Institute of Basic Sciences, University of Sopron
Sopron, Hungary
Department of Mathematics, Jan Selye University
Komárno, Slovakia
Fatih Yilmaz
Department of Mathematics, Ankara Hacı Bayram Veli University
Ankara, 06900, Turkey
Abstract
In this study, we investigate the matrix formulation of the generalized -periodic linear recursive sequences. To reach our goal, we consider the properties of the Fibonacci–Horner decomposition of the matrix powers and those of the weighted linear recursive sequence of Fibonacci type. We provide the linear, the combinatorial, and the analytic representations of the generalized
-periodic linear recursive sequences. For illustrating our general results, properties of some special cases are studied and numerical example are furnished.
Keywords
- Generalized
-periodic linear recursive sequences
- Analytic representation
- Linear combinatorial representation
- Fibonacci–Horner decomposition
2020 Mathematics Subject Classification
- 11B39
- 11B75
- 11C20
- 65Q10
- 65Q30
References
- Aiat Hadj Ahmed, D., Bentaleb, A., Rachidi, M., & Zitan, F. (2009). Powers of matrices by density and divided differences. International Journal of Algebra, 3(9), 407–422.
- Ben Taher, R., Mouline, M., & Rachidi, M. (2006). Fibonacci–Horner decomposition of the matrix exponential and the fundamental solution. Electronic Linear Algebra, 15, 178–190.
- Ben Taher, R., & Rachidi, M. (2016). Solving some generalized Vandermonde systems and inverse of their associate matrices via new approaches for the Binet formula. Applied Mathematics and Computation, 290, 267–280.
- Choo, Y. (2019). Some identities on generalized bi-periodic Fibonacci sequences. International Journal of Mathematical Analysis, 13(6), 259–267.
- Edson, M., & Yayenie, O. (2009). A new generalization of Fibonacci sequence and extended Binet’s formula. Integers, 9, 639–654.
- Irmak, N., & Szalay, L. (2012). On k-periodic binary recurrences. Annales Mathematicae et Informaticae, 40, 25–35.
- Koshy, T. (2014). Pell and Pell–Lucas Numbers with Applications. Springer, New York.
- Koshy, T. (2018). Fibonacci and Lucas Numbers with Applications. Springer, Volume 1, John Wiley and Sons, New Jersey.
- Mouline, M., & Rachidi, M. (1999). Application of Markov chains properties to r-generalized Fibonacci sequences. The Fibonacci Quarterly, 37, 34–38.
- Rachidi, M., Spreafico, E. V. P., & Catarino, P. (2024). On a matrix formulation of the sequence of bi-periodic Fibonacci numbers. Axioms, 13(9), Article ID 590.
- Rachidi, M., & Yilmaz, F. (2025). On the bi-periodic (k, s)-Jacobsthal numbers via the Fibonacci–Hörner decomposition of matrix powers. Logic Journal of the IGPL, DOI: 10.1093/jigpal/jzae129.
- Uygun, S., & Owusu, E. (2016). A new generalization of Jacobsthal numbers (Bi-periodic Jacobsthal sequences). Journal of Mathematical Analysis, 7(5), 28–39.
- Uygun, S., & Owusu, E. (2019). A new generalization of Jacobsthal Lucas numbers (Bi-periodic Jacobsthal Lucas sequence). Journal of Advances in Mathematics and Computer Science, 34(5), 1–13, DOI: 10.9734/jamcs/2019/v34i530226.
Manuscript history
- Received: 6 April 2025
- Revised: 14 May 2025
- Accepted: 20 May 2025
- Online First: 2 June 2025
Copyright information
Ⓒ 2025 by the Authors.
This is an Open Access paper distributed under the terms and conditions of the Creative Commons Attribution 4.0 International License (CC BY 4.0).
Related papers
Cite this paper
Rachidi, M., Szalay, L., & Yilmaz, F. (2025). On the generalized p-periodic linear recursive sequences via the Fibonacci–Horner decomposition of the matrix powers. Notes on Number Theory and Discrete Mathematics, 31(2), 311-325, DOI: 10.7546/nntdm.2025.31.2.311-325.