A new method to compute the terms of generalized order-\(k\) Fibonacci numbers
From MaRDI portal
Publication:740857
DOI10.1016/j.jnt.2013.03.007zbMath1295.11017OpenAlexW2044281344WikidataQ114157575 ScholiaQ114157575MaRDI QIDQ740857
Publication date: 9 September 2014
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jnt.2013.03.007
Related Items (5)
Determinantal and permanental representations of Fibonacci type numbers and polynomials ⋮ A common generalization of convolved generalized Fibonacci and Lucas polynomials and its applications ⋮ Determinantal and permanental representations of convolved Lucas polynomials ⋮ Some identities of the generalized Fibonacci and Lucas sequences ⋮ Unnamed Item
Cites Work
- A new algorithm for computing the inverse and the determinant of a Hessenberg matrix
- Determinants and permanents of Hessenberg matrices and generalized Lucas polynomials
- Hessenberg matrices and the Pell and Perrin numbers
- \(k\)-Lucas numbers and associated bipartite graphs
- On the representation of \(k\)-generalized Fibonacci and Lucas numbers
- Generalized Fibonacci Numbers and Associated Matrices
- Counting Determinants of Fibonacci–Hessenberg Matrices Using LU Factorizations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A new method to compute the terms of generalized order-\(k\) Fibonacci numbers