login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A323705
Odd primes p such that ((p+1)/2)^(p-1) == 1 (mod p^2).
0
1897121, 52368101, 126233057
OFFSET
1,1
COMMENTS
The corresponding sequence when (p+1) in the congruence is replaced with (p-1) seems to be A125854.
a(4) > 4262937421 if it exists.
MATHEMATICA
Select[Prime[Range[718*10^4]], PowerMod[(#+1)/2, #-1, #^2]==1&] (* Harvey P. Dale, May 14 2021 *)
PROG
(PARI) forprime(p=3, , my(x=(p+1)/2); if(Mod(x, p^2)^(p-1)==1, print1(p, ", ")))
CROSSREFS
Sequence in context: A032597 A203794 A204672 * A249318 A194620 A182360
KEYWORD
nonn,hard,bref,more
AUTHOR
Felix Fröhlich, Jan 24 2019
STATUS
approved