Fibonacci n-step number sequences: Difference between revisions

m
m (→‎Python: Curried: (pruned out one superfluous generic))
Line 3,271:
(append
(tail(xs))
([sum(xs)]))
(n - 1))
(n - 1)
)
) if (0 < n and 0 < len(xs)) else []
return lambda n: go(xs)(n)
9,655

edits