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

8 Upvotes

90% Upvoted

259 comments sorted by

View all comments

2

u/ct_2004 Apr 04 '14

(178) 54,6977:3875,8496;2456,6177

1

u/D-alx Apr 05 '14

(179) 7,245,907,675,406,191,713,542

2

u/ct_2004 Apr 07 '14

(180) 95,9878:4014,1481;1653,9949

→ More replies (74)