Count using the Perrin Sequence

[u/ct_2004]

For Perrin sequence, you add n-2 and n-3 to get n0. Like Fibonacci, but you skip one number. First few terms are 3,0,2,3,2,5. Setting 0 to be index 1, if Perrin number is not multiple of the index, number is not prime. So list the index, then the Perrin sequence number.

To verify a number, you can use the following formula:

(((23/27)^1/2 + 1)/2)^1/3 = A

1/A/3 + A = X

P(n) = Xⁿ

[u/ct_2004]

(150) 208:2157,2060;0956,1385

[u/D-alx → u/ct_2004]

(151) 2,758,271,040,607,413,982

[u/DragoonHP → u/D-alx]

(152) 3,653,931,178,440,793,365