Fibonacci n-step number sequences: Difference between revisions
→{{header|Phix}}
(added Scheme example) |
|||
Line 2,228:
}
say fib(2, [2,1])[^20];</lang>
=={{header|Phix}}==
<lang Phix>function nacci_noo(integer n, s, l)
if n<2 then return n+n*l end if
if n=2 then return 1 end if
atom res = nacci_noo(n-1,s,l)
for i=2 to min(s,n-1) do
res += nacci_noo(n-i,s,l)
end for
return res
end function
constant names = split("fibo tribo tetra penta hexa hepta octo nona deca lucas")
for i=1 to 4 do
sequence f = {}
for j=1 to 10 do
f = append(f,nacci_noo(j,iff(i<4?i+1:2),i=4))
end for
printf(1,"%snacci: %s\n",{names[i+(i=4)*6],sprint(f)})
end for</lang>
{{out}}
<pre>
fibonacci: {1,1,2,3,5,8,13,21,34,55}
tribonacci: {1,1,2,4,7,13,24,44,81,149}
tetranacci: {1,1,2,4,8,15,29,56,108,208}
lucasnacci: {2,1,3,4,7,11,18,29,47,76}
</pre>
=={{header|PicoLisp}}==
| |||