A355961 Primes p such that (p+6)^(p-1) == 1 (mod p^2).

13, 47, 3803, 151051, 240727, 259933847

Offset

1,1

Links

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

Prog

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

Crossrefs

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

Sequence in context: A146806 A300337 A353965 * A135712 A225920 A027980

Adjacent sequences: A355958 A355959 A355960 * A355962 A355963 A355964

Keyword

nonn,hard,more

Author

Felix Fröhlich, Jul 21 2022

Status

approved