A355963 Primes p such that (p+8)^(p-1) == 1 (mod p^2).

1531, 7445287

Offset

1,1

Comments

a(3) > 34294200797 if it exists.

Links

Table of n, a(n) for n=1..2.

Prog

(PARI) forprime(p=1, , if(Mod(p+8, p^2)^(p-1)==1, print1(p, ", ")))

Crossrefs

(p+k)^(p-1) == 1 (mod p^2): A355959 (k=2), A355960 (k=5), A355961 (k=6), A355962 (k=7), A355964 (k=9), A355965 (k=10).

Sequence in context: A057328 A110022 A339075 * A306850 A296781 A278192

Adjacent sequences: A355960 A355961 A355962 * A355964 A355965 A355966

Keyword

nonn,hard,more,bref

Author

Felix Fröhlich, Jul 21 2022

Status

approved