blob: df5ae80e8e71785d4429e06deae41b16ab07a957 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
|
## Remarks
## https://en.wikipedia.org/wiki/Perrin_number
import math
def IsPrime(nInput):
for nDiv in range(2, int(math.sqrt(nInput)) + 1):
if nInput % nDiv == 0:
return False
return True
arrPerrinPrime = []
arrPerrinNum = []
arrPerrinNum.append(3)
arrPerrinNum.append(0)
arrPerrinNum.append(2)
arrPerrinPrime.append(2)
arrPerrinPrime.append(3)
while len(arrPerrinPrime) < 13:
nNuNum = arrPerrinNum[-2] + arrPerrinNum[-3]
arrPerrinNum.append(nNuNum)
if not IsPrime(nNuNum):
continue
nCount = arrPerrinPrime.count(nNuNum)
if nCount > 0:
continue
arrPerrinPrime.append(nNuNum)
print (arrPerrinPrime)
|
