On the \(k\)-generalized Fibonacci numbers and high-order linear recurrence relations (Q2479153)

The \(k\)-generalized Fibonacci sequence \(\{f_n\}\) for positive integer \(k\geq 2\) is defined as \[ f_n= a_1 f_{n-1}- a_2 f_{n-2}+ a_3 f_{n-2}-\cdots+(-1)^{k- 1}a_k f_{n-k}, \quad n\geq 1, \] \(f_0= 1\) and \(f_i= 0\) for each negative \(i\), and \(a_1,\dots, a_k\) are arbitrary real numbers. Using elementary symmetric functions and complete homogeneous symmetric functions a determinant formula for this sequence is obtained. The relationship between the \(k\)-generalized Fibonacci sequence and the sequence defined as above, but with arbitrary initial values \(f_0,f_1,\dots, f_{k-1}\) is discussed. Some further results are given.