Motzkin numbers: Difference between revisions
add FreeBASIC
(Add swift) |
(add FreeBASIC) |
||
Line 410:
40 66,368,199,913,921,497
41 192,137,918,101,841,817
</pre>
=={{FreeBASIC}}==
Use any of the primality testing examples as an include.
<lang freebasic>
#include "isprime.bas"
dim as ulongint M(0 to 41)
M(0) = 1 : M(1) = 1
print "1" : print "1"
for n as integer = 2 to 41
M(n) = M(n-1)
for i as uinteger = 0 to n-2
M(n) += M(i)*M(n-2-i)
next i
print M(n),
if isprime(M(n)) then print "is a prime" else print
next n
</lang>
{{out}}
<pre>
1
1
2 is a prime
4
9
21
51
127 is a prime
323
835
2188
5798
15511 is a prime
41835
113634
310572
853467
2356779
6536382
18199284
50852019
142547559
400763223
1129760415
3192727797
9043402501
25669818476
73007772802
208023278209
593742784829
1697385471211
4859761676391
13933569346707
40002464776083
114988706524270
330931069469828
953467954114363 is a prime
2750016719520991
7939655757745265
22944749046030949
66368199913921497
192137918101841817
</pre>
| |||