A308079 Pseudoprimes to base 3 that divide a Mersenne number.
10974881, 193949641, 717653129, 8762386393, 19683169273, 24802217129, 78618861353, 121271968201, 146050578391, 169905267617, 188684740591, 232153956569, 290762221753, 306091598201, 336675266287, 394233108121, 592050558553
Offset: 1
Keywords
Examples
10974881 is in the sequence because it divides 2^239 - 1 (and 239 is prime), it is not a prime, but 3^10974880 === 1 (mod 10974881).
Links
- Amiram Eldar, Table of n, a(n) for n = 1..202 (terms below 10^15)
- Mersenne Forum, Composite PRP (discussion thread).
Programs
-
PARI
forstep(n=3,+oo,2,Mod(3,n)^(n-1)==1&&!ispseudoprime(n)&&ispseudoprime(znorder(Mod(2,n)))&&print1(n,", "))
Comments