Padovan n-step number sequences: Difference between revisions
→{{Header|Phix}}
Line 267:
|-
|}
=={{header|Phix}}==
{{trans|Go}}
<lang Phix>function padovann(integer n,t)
if n<2 or t<3 then return repeat(1,t) end if
sequence p = padovann(n-1, t)
for i=n+2 to t do
p[i] = 0
for j=i-2 to i-n-1 by -1 do
p[i] += p[j]
end for
end for
return p
end function
constant t = 15,
fmt = "%d: %d %d %d %d %d %d %d %2d %2d %2d %2d %2d %3d %3d %3d\n"
printf(1,"First %d terms of the Padovan n-step number sequences:\n",t)
for n=2 to 8 do
printf(1,fmt,n&padovann(n,t))
end for</lang>
{{out}}
<pre>
First 15 terms of the Padovan n-step number sequences:
2: 1 1 1 2 2 3 4 5 7 9 12 16 21 28 37
3: 1 1 1 2 3 4 6 9 13 19 28 41 60 88 129
4: 1 1 1 2 3 5 7 11 17 26 40 61 94 144 221
5: 1 1 1 2 3 5 8 12 19 30 47 74 116 182 286
6: 1 1 1 2 3 5 8 13 20 32 51 81 129 205 326
7: 1 1 1 2 3 5 8 13 21 33 53 85 136 218 349
8: 1 1 1 2 3 5 8 13 21 34 54 87 140 225 362
</pre>
=={{Header|Python}}==
| |||