Fibonacci n-step number sequences: Difference between revisions

m
m (→‎{{header|Haskell}}: Added an example using unfoldr)
Line 2,110:
( ("lucas:" : fmap show (take 15 a000032)) :
zipWith
( \k n -> k : fmap show (take 15 $ nStepFibonacci n))
(k <> "nacci:") :
fmap
show
(take 15 $ nStepFibonacci n)
)
(words "fibo tribo tetra penta hexa hepta octo nona deca")
[2 ..]
Line 2,133 ⟶ 2,138:
<pre>Recurrence relation sequences:
 
lucas: 2 1 3 4 7 11 18 29 47 76 123 199 322 521 843
fibo fibonacci: 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610
tribotribonacci: 1 1 2 4 7 13 24 44 81 149 274 504 927 1705 3136
tetratetranacci: 1 1 2 4 8 15 29 56 108 208 401 773 1490 2872 5536
pentapentanacci: 1 1 2 4 8 16 31 61 120 236 464 912 1793 3525 6930
hexa hexanacci: 1 1 2 4 8 16 32 63 125 248 492 976 1936 3840 7617
heptaheptanacci: 1 1 2 4 8 16 32 64 127 253 504 1004 2000 3984 7936
octo octonacci: 1 1 2 4 8 16 32 64 128 255 509 1016 2028 4048 8080
nona nonanacci: 1 1 2 4 8 16 32 64 128 256 511 1021 2040 4076 8144
deca decanacci: 1 1 2 4 8 16 32 64 128 256 512 1023 2045 4088 8172</pre>
 
=={{header|Icon}} and {{header|Unicon}}==
9,655

edits