Solutions for k-generalized Fibonacci numbers using Fuss-Catalan numbers

Abstract

We present new expressions for the k-generalized Fibonacci numbers, say Fk(n). They satisfy the recurrence Fk(n) = Fk(n-1) +…+Fk(n-k). Explicit expressions for the roots of the auxiliary (or characteristic) polynomial are presented, using Fuss-Catalan numbers. Properties of the roots are enumerated. We quantify the accuracy of asymptotic approximations for Fk(n) for n1. Our results subsume and extend some results published by previous authors. We also present a basis (or `fundamental solutions') to solve the above recurrence for arbitrary initial conditions. We comment on the use of generating functions and multinomial sums for the k-generalized Fibonacci numbers and related sequences. We note that the resulting multinomial sums are Dickson polynomials of the second kind in several variables. We also present what may be a new identity for companion matrices.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…