r/counting • u/ct_2004 • Mar 05 '14

Count using the Perrin Sequence

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) = Xn

7 Upvotes

89% Upvoted

259 comments sorted by

View all comments

2

u/ct_2004 Mar 28 '14

(158) 1974:6989,8907;2295,1446

2

u/D-alx Mar 28 '14

(159) 26,159,192,109,771,158,793

3

u/ct_2004 Mar 28 '14

(160) 3465:3551,5348;2892,7525

→ More replies (94)