A simplified binet formula for $k$-generalized Fibonacci numbers
J. Integer Seq. 17(4), Article 14.4.7, 9 p., electronic only (2014)
Summary
Summary: In this paper, we present a Binet-style formula that can be used to produce the k-generalized Fibonacci numbers (that is, the Tribonaccis, Tetranaccis, etc.). Furthermore, we show that in fact one needs only take the integer closest to the first term of this Binet-style formula in order to generate the desired sequence.
