|
|
A260507
|
|
Primes p such that (2^p+1)^(p-1) == 1 (mod p^2).
|
|
2
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(6) > 10325801 if it exists.
|
|
LINKS
|
|
|
EXAMPLE
|
2^7 + 1 = 129 and 129^6 == 1 (mod 7^2), so 7 is a term of the sequence.
|
|
MATHEMATICA
|
Select[Prime@ Range@ 120, Mod[(2^# + 1)^(# - 1), #^2] == 1 &] (* Michael De Vlieger, Jul 29 2015 *)
|
|
PROG
|
(PARI) forprime(p=2, , if(Mod(2^p+1, p^2)^(p-1)==1, print1(p, ", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|