Abstract

Abstract Let un = un (k) denote the generalized Leonardo number defined recursively by un = un− 1 + un− 2 + k for n ≥ 2, where u 0 = u 1 = 1. Terms of the sequence un (1) are referred to simply as Leonardo numbers. In this paper, we find expressions for the determinants of several Toeplitz–Hessenberg matrices having generalized Leonardo number entries. These results are obtained as special cases of more general formulas for the generating function of the corresponding sequence of determinants. Special attention is paid to the cases 1 ≤ k ≤ 7, where several connections are made to entries in the On-Line Encyclopedia of Integer Sequences. By Trudi’s formula, one obtains equivalent multi-sum identities involving sums of products of generalized Leonardo numbers. Finally, in the case k = 1, we also provide combinatorial proofs of the determinant formulas, where we make extensive use of sign-changing involutions on the related structures.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.