ON THE GENERALISED SECOND-ORDER LINEAR RECURRENCES RELATIONS AND IDENTITIES
DOI:
https://doi.org/10.46754/jmsi.2025.06.003Keywords:
Generalised, recurrence, subtraction formula, addition formula, identitiesAbstract
In this article, we study the sequence {Vn}, which is generated by the (p, q)-Generalised linear recurrence relation of second order Vn(p, q, a, b) = pVn-1 + qVn-2, n ≥ 2, with the initial terms V0 = a, V1 = b, where p, q, a and b (ab ≠ 0, pq ≠ 0) are arbitrary real numbers. Addition, subtraction formulas, Binet formula and some new results are obtained and studied in the generalised form. Some existing and new identities are also explored, employing this generalized definition of the sequence {Vn} and becoming the special cases, on substituting the coefficients p, q of the recurrence relation and the initial terms V0, V1.
References
Horadam, A.F., and Shannon, A.G. (1987). Generalisation of identities of Catalan and others. Portugaliae Mathematica, 44(2), 137-148.
Howard, F. T. (2003). The sum of the squares of two generalised Fibonacci numbers. The Fibonacci Quarterly, 41(1), 80-84. https://doi.org/10.1080/00150517.2003.12428608 DOI: https://doi.org/10.1080/00150517.2003.12428608
Horadam, A. F. (1965). Basic properties of a certain generalised sequence of numbers. The Fibonacci Quarterly, 3(3), 161-176. https://doi.org/10.1080/00150517.1965.12431416 DOI: https://doi.org/10.1080/00150517.1965.12431416
Adam, M. (2016). Powers of the generalised 2-Fibonacci matrices. Journal of Applied Mathematics & Bioinformatics, 6(3), 145-154.
Basu, M., & Prasad, B. (2008). The generalised relations among the code elements for Fibonacci coding theory. Chaos Solitons & Fractals, 41(5), 2517-2525. https://doi.org/10.1016/j.chaos.2008.09.030 DOI: https://doi.org/10.1016/j.chaos.2008.09.030
Benjamin, A. T., & Quinn, J. J. (1999). Recounting Fibonacci and Lucas identities. College Mathematics Journal, 30(5), 359-366. https://doi.org/10.1080/07468342.1999.11974086 DOI: https://doi.org/10.1080/07468342.1999.11974086
Benjamin, A. T., Quinn, J. J., & Su, F. E. (2000). Phased tilings and generalized Fibonacci identities. The Fibonacci Quarterly, 38(3), 272-288. https://doi.org/10.1080/00150517.2000.12428804 DOI: https://doi.org/10.1080/00150517.2000.12428804
Brousseau, A. (1968). A sequence of power formulas. The Fibonacci Quarterly, 6(1), 81-83. https://doi.org/10.1080/00150517.1968.12431264 DOI: https://doi.org/10.1080/00150517.1968.12431264
Gulec, H. H., & Taskara, B. (2009). On the properties of fibonacci numbers with binomial coefficients. International Journal of Contemporary Mathematical Sciences, 4(25), 1251-1256. https://doi.org/10.2307/3617892
Kalman, D., & Mena, R. (2003). The fibonacci numbers—Exposed. Mathematics Magazine, 76(3), 167-181. https://doi.org/10.1080/0025570x.2003.11953176 DOI: https://doi.org/10.1080/0025570X.2003.11953176
Kilic, E. (2007). Sums of generalized Fibonacci numbers by matrix methods. Ars Combinatoria, 84, 23-31. https://dblp.uni-trier.de/db/journals/arscom/arscom84.html#Kilic07
Koshy, T. (2011). Fibonacci and lucas numbers with applications. Netherlands: John Wiley Sons.
Melham, R. S., & Shannon, A. G. (1995). A generalisation of the Catalan identity and some consequences. The Fibonacci Quarterly, 33(1), 82-84. https://doi.org/10.1080/00150517.1995.12429178 DOI: https://doi.org/10.1080/00150517.1995.12429178
Rabinowitz, S. (1999). Algorithmic manipulation of Second-Order linear recurrences. The Fibonacci Quarterly, 37(2), 162-176. https://doi.org/10.1080/00150517.1999.12428875 DOI: https://doi.org/10.1080/00150517.1999.12428875
Silvester, J. R. (1979). Fibonacci properties by matrix methods. The Mathematical Gazette, 63(425), 188-191. https://doi.org/10.2307/3617892 DOI: https://doi.org/10.2307/3617892
Stakhov, A. (2006). Fibonacci matrices, a generalisation of the “Cassini formula”, and a new coding theory. Chaos Solitons & Fractals, 30(1), 56-66. https://doi.org/10.1016/j.chaos.2005.12.054 DOI: https://doi.org/10.1016/j.chaos.2005.12.054
Stakhov, A. (1999). A generalisation of the Fibonacci Q-matrix. Reports of the National Academy of Sciences of Ukraine, 9, 46-49.
Vajda, S. (2008). Fibonacci and lucas numbers, and the golden section: Theory and applications. Dover Press.
Verma, K. L. (2024). A comprehensive generalisation of classical fibonacci sequences, binet formula and identities. Journal of Applied and Pure Mathematics, 5-6, 283-299. https://doi.org/10.23091/japm.2024.283
Kalman, D. (1982). Generalized fibonacci numbers by matrix methods. The Fibonacci Quarterly, 20(1), 73-76. DOI: https://doi.org/10.1080/00150517.1982.12430034
Adam, M., & Assimakis, N. (2014). K-Step sum and M-Step gap Fibonacci sequence. ISRN Discrete Mathematics, 2014, 1-7. https://doi.org/10.1155/2014/374902 DOI: https://doi.org/10.1155/2014/417623
Adam, M., & Assimakis, N. (2017). k–step Fibonacci sequences and Fibonacci matrices. Journal of Discrete Mathematical Sciences and Cryptography, 20(5), 1183-1206. https://doi.org/10.1080/09720529.2015.1104929 DOI: https://doi.org/10.1080/09720529.2015.1104929
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Journal of Mathematical Sciences and Informatics
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
