A sequence of numbers where each number is the sum of the k preceding numbers. The usual Fibonacci numbers occur when k=2. Formal Definition:

• F^(k)_n = F^(k)_n-1 + F^(k)_n-2 + . . . + F^(k)_n-k for n ≥ k.
• F^(k)_k-1 = 1
• F^(k)_n = 0 for 0 ≤ n ≤ k-2