Padovan n-step number sequences: Difference between revisions
→{{header|Ruby}}: Add Ruby
(New post.) |
(→{{header|Ruby}}: Add Ruby) |
||
Line 1,491:
</pre>
=={{header|Ruby}}==
<syntaxhighlight lang="ruby">def padovan(n_step)
return to_enum(__method__, n_step) unless block_given?
ar = [1, 1, 1]
loop do
yield sum = ar[..-2].sum
ar.shift if ar.size > n_step
ar << sum
end
end
t = 15
(2..8).each do |n|
print "N=#{n} :"
puts "%5d"*t % padovan(n).take(t)
end
</syntaxhighlight>
{{out}}
<pre>N=2 : 2 2 3 4 5 7 9 12 16 21 28 37 49 65 86
N=3 : 2 3 4 6 9 13 19 28 41 60 88 129 189 277 406
N=4 : 2 3 5 7 11 17 26 40 61 94 144 221 339 520 798
N=5 : 2 3 5 8 12 19 30 47 74 116 182 286 449 705 1107
N=6 : 2 3 5 8 13 20 32 51 81 129 205 326 518 824 1310
N=7 : 2 3 5 8 13 21 33 53 85 136 218 349 559 895 1433
N=8 : 2 3 5 8 13 21 34 54 87 140 225 362 582 936 1505
</pre>
=={{header|Rust}}==
<syntaxhighlight lang="rust">
| |||