Home >  Term: kth order Fibonacci numbers
kth order Fibonacci numbers

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

0 0

Creator

  • GeorgeV
  •  (Gold) 1123 points
  • 100% positive feedback
© 2024 CSOFT International, Ltd.