Computing Hyperfibonacci Numbers by Means of Matrix Transformations and Jordan Forms

The Hyperfibonacci sequence of the $r$th generation is defined recursively as a generalization of Fibonacci numbers, where each term is obtained by summing the terms of the Hyperfibonacci sequence of the preceding generation. We introduce the transformation matrix for Hyperfibonacci numbers, which enables us to determine the next term in a given generation. We explore the algebraic structure of that matrix, and its power of $n$, similarity transformations between these matrices and their Jordan canonical forms. Finally, we analyze the powers of these matrices using their Jordan forms, obtaining compact and elegant formulas for expressing $r$-generation Hyperfibonacci numbers in terms of Fibonacci numbers.