The k-generalized Fibonacci sequence (F (k) n ) n resembles the Fibonacci sequence in that it starts with 0, . . . , 0, 1 (a total of k terms) and each term afterwards is the sum of the k preceding terms. F. Luca [4] in 2000 and recently D. Marques
No takes yet. Share an insight, caveat, or question.
Bravo et al. (2013) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: