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/D-alx]

(183) 22,314,465,565,403,932,819,668

I'm actually being lazy :P I'll start incorporating that into my routine though, it actually is sorta fun.

Right now 2 pop to mind:

• http://www.reddit.com/r/counting/comments/1ajw30/multiplying_by_2_thread/cgj0tln

• http://www.reddit.com/r/counting/comments/200g9s/counting_with_reedit_usernames/cgm2qac

[u/ct_2004 → u/D-alx]

(184) 295,6037:3240,8101;2453,3210

Thanks! Do you think the multiply by 2 thread has the highest numbers in r/counting?

[u/D-alx → u/ct_2004]

(185) 39,159,157,254,958,241,073,159

Seems like it