Padovan n-step number sequences: Difference between revisions
Added Easylang
(Added Just Basic) |
(Added Easylang) |
||
Line 907:
8: 1 1 1 2 3 5 8 13 21 34 54 87 140 225 362
</pre>
=={{header|EasyLang}}==
{{trans|FreeBASIC}}
<syntaxhighlight>
t = 15
len p[] t
#
proc padovan n . .
if n < 2 or t < 3
for i = 1 to t
p[i] = 1
.
return
.
padovan n - 1
for i = n + 2 to t
p[i] = 0
for j = i - 2 downto i - n - 1
p[i] += p[j]
.
.
.
for n = 2 to 8
padovan n
write n & ": "
for i = 1 to t
write p[i] & " "
.
print ""
.
</syntaxhighlight>
=={{header|F_Sharp|F#}}==
Line 925 ⟶ 957:
1 1 1 2 3 5 8 13 21 34 54 87 140 225 362
</pre>
=={{header|Factor}}==
{{works with|Factor|0.99 2021-02-05}}
| |||