A355546 Primes p that satisfy q^(p-1) == 1 (mod p^2), i.e., are base-q Wieferich primes, for a prime q dividing p+1.

11, 1093, 3511, 7195291, 11642831, 13703077, 112955593, 5857727461

Offset

1,1

Links

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

Example

p = 7195291 satisfies 138371^(p-1) == 1 (mod p^2) and 138371 is a factor of 7195292, so 7195291 is a term of the sequence.

Prog

(PARI) is(n) = my(f=factor(n+1)[, 1]~); for(k=1, #f, if(Mod(f[k], n^2)^(n-1)==1, return(1))); 0
forprime(p=1, , if(is(p), print1(p, ", ")))

Crossrefs

Cf. A355545.

Sequence in context: A004811 A227323 A126197 * A090814 A347846 A319424

Adjacent sequences: A355543 A355544 A355545 * A355547 A355548 A355549

Keyword

nonn,hard,more

Author

Felix Fröhlich, Jul 06 2022

Extensions

a(8) from Michael S. Branicky, Jul 10 2022

Status

approved