Leonardo and hyper-Leonardo numbers via Riordan arrays
From MaRDI portal
Publication:6608875
DOI10.1007/S11253-024-02325-8MaRDI QIDQ6608875FDOQ6608875
Authors: Yasemin Alp, E. Gökçen Koçer
Publication date: 20 September 2024
Published in: Ukrainian Mathematical Journal (Search for Journal in Brave)
Recommendations
Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Binomial coefficients; factorials; (q)-identities (11B65)
Cites Work
- The Riordan group
- Riordan arrays and combinatorial sums
- Sequence characterization of Riordan arrays
- On Some Alternative Characterizations of Riordan Arrays
- Lagrange inversion: when and how
- Pascal triangles, Catalan numbers and renewal arrays
- Some algebraic structure of the Riordan group
- Matrix characterizations of Riordan arrays
- A symmetric algorithm for hyperharmonic and Fibonacci numbers
- A symmetric algorithm for hyper-Fibonacci and hyper-Lucas numbers
- Fibonacci and Lucas Numbers With Applications
- THE GENERALIZED PASCAL MATRIX VIA THE GENERALIZED FIBONACCI MATRIX AND THE GENERALIZED PELL MATRIX
- Title not available (Why is that?)
- \(q\)-Riordan representation
- \(q\)-Riordan array for \(q\)-Pascal matrix and its inverse matrix
- The \(F\)-analogue of Riordan representation of Pascal matrices via Fibonomial coefficients
Cited In (1)
This page was built for publication: Leonardo and hyper-Leonardo numbers via Riordan arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608875)