Motzkin numbers: Difference between revisions

→‎{{header|Raku}}: Add alternate
(→‎{{header|Phix}}: added native alternative, limited to M[37] on 32 bit and p2js)
(→‎{{header|Raku}}: Add alternate)
Line 322:
 
=={{header|Raku}}==
===Using binomial coefficients and Catalan numbers===
<lang perl6>use Lingua::EN::Numbers;
 
Line 331 ⟶ 332:
 
say " 𝐧 𝐌[𝐧] Prime?";
 
𝐌[^42].kv.map: { printf "%2d %24s %s\n", $^k, $^v.&comma, $v.is-prime };</lang>
{{out}}
Line 377:
40 66,368,199,913,921,497 False
41 192,137,918,101,841,817 False</pre>
 
===Using recurrence relationship===
 
<lang perl6>use Lingua::EN::Numbers;
 
my \𝐌 = 1, 1, { state $i = 2; ++$i; ($^b × (2 × $i - 1) + $^a × (3 × $i - 6)) ÷ ($i + 1) } … *;
 
say " 𝐧 𝐌[𝐧] Prime?";
𝐌[^42].kv.map: { printf "%2d %24s %s\n", $^k, $^v.&comma, $v.is-prime };</lang>
 
Same output
 
=={{header|REXX}}==
10,333

edits