Generalized Fibonacci–Leonardo numbers
From MaRDI portal
Publication:6192997
Recommendations
Cites work
- Fibonacci and Lucas numbers with applications. Volume I
- Fibonacci matrices, a generalization of the ``Cassini formula, and a new coding theory
- From golden to unimodular cryptography
- Generalized sequences and \(k\)-independent sets in graphs
- scientific article; zbMATH DE number 5572943 (Why is no real title available?)
- scientific article; zbMATH DE number 3745213 (Why is no real title available?)
- scientific article; zbMATH DE number 7289710 (Why is no real title available?)
- scientific article; zbMATH DE number 3392470 (Why is no real title available?)
- Hybrid Leonardo numbers
- Linear recurrent cryptography: Golden-like cryptography for higher order linear recurrences
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- Smoothsort, an alternative for sorting in situ
- Some application of difference equations in cryptography and coding theory
- The ``golden matrices and a new kind of cryptography
Cited in
(6)- Leonardo and hyper-Leonardo numbers via Riordan arrays
- On identities associated with generalized Fibonacci and Tribonacci numbers using matrices
- An explicit formula for supergeneralized Leonardo p-numbers
- On the norms and Hadamard product of Toeplitz matrices involving Leonardo numbers
- Generalised Leonardo numbers
- On one-parameter generalization of Fibonacci and Leonardo elliptic quaternions.
This page was built for publication: Generalized Fibonacci–Leonardo numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192997)
