On the generalized order-\(k\) Fibonacci and Lucas numbers (Q2477932)

The definition of \(k\) sequences of the generalized order-\(k\) Fibonacci numbers is the following: \(g^i_n= \sum^k_{j=1} g^i_{n-j}\) for \(n> 0\) and \(1- k\leq n\leq 0\), \(g^i_n= 1\) if \(i= 1-n\) and \(0\) otherwise, where \(g^i_n\) is the \(n\)th term of the \(i\)th sequence. With boundary conditions for \(1-k\leq n\leq 0\), \(g^{1-n}_n= -1\), \(g^{2-n}_n= 2\) and \(0\) otherwise the generalized order-\(k\) Lucas numbers are given. With \(k=2\) the sequence \(\{g^2_n\}\) is the usual Fibonacci resp. Lucas sequence. Then the generalized Binet formula, combinatorial representation and some other relations are discussed.