(definition)
Definition: 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:
Also known as pth order Fibonacci numbers.
See also optimal polyphase merge.
Author: PEB
Apparently first studied by V. Schlegel, El Progreso Matemático, 4:173-174, 1894.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.
Cite this as:
Paul E. Black, "kth order Fibonacci numbers", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/kthOrderFibonacci.html