Motzkin numbers: Difference between revisions
Content deleted Content added
→{{header|Phix}}: added native alternative, limited to M[37] on 32 bit and p2js |
Thundergnat (talk | contribs) →{{header|Raku}}: Add alternate |
||
| Line 322: | Line 322: | ||
=={{header|Raku}}== |
=={{header|Raku}}== |
||
===Using binomial coefficients and Catalan numbers=== |
|||
<lang perl6>use Lingua::EN::Numbers; |
<lang perl6>use Lingua::EN::Numbers; |
||
| Line 331: | Line 332: | ||
say " 𝐧 𝐌[𝐧] Prime?"; |
say " 𝐧 𝐌[𝐧] Prime?"; |
||
𝐌[^42].kv.map: { printf "%2d %24s %s\n", $^k, $^v.&comma, $v.is-prime };</lang> |
𝐌[^42].kv.map: { printf "%2d %24s %s\n", $^k, $^v.&comma, $v.is-prime };</lang> |
||
{{out}} |
{{out}} |
||
| Line 377: | Line 377: | ||
40 66,368,199,913,921,497 False |
40 66,368,199,913,921,497 False |
||
41 192,137,918,101,841,817 False</pre> |
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}}== |
=={{header|REXX}}== |
||