Fibonacci n-step number sequences: Difference between revisions

Enough examples so out of draft status.
(Enough examples so out of draft status.)
Line 1:
{{draft task}}
These number series are an expansion of the ordinary [[Fibonacci sequence]] where:
# For <math>n = 2</math> we have the Fibonacci sequence; with initial values <math>[1, 1]</math> and <math>F_k^2 = F_{k-1}^2 + F_{k-2}^2</math>
Anonymous user