Fibonacci n-step number sequences: Difference between revisions
m
→Python: Defined in terms of a generic anamorphism
Line 3,480:
# A000032 :: () -> [Int]
def A000032():
'''Non finite sequence of Lucas numbers.
'''
def relation(xs):▼
return xs[0], xs[1:] + [sum(take(2)(xs))]▼
▲ return unfoldr(relation)([2, 1])
Line 3,493 ⟶ 3,490:
defined by a recurrence relation.
'''
▲ return unfoldr(relation)(
take(n)(
chain(
Line 3,504 ⟶ 3,498:
)
)
# recurrence :: Int -> [Int] -> Int
def recurrence(n):
'''Recurrence relation in Fibonacci and related series.
'''
return go
| |||