A123693 Primes p such that p^2 divides 7^(p-1) - 1.

5, 491531

Offset

1,1

Comments

No further terms below 1.2*10^15 (see Fischer link).

Links

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

Amir Akbary and Sahar Siavashi, The Largest Known Wieferich Numbers, INTEGERS, 18(2018), A3. See Table 1 p. 5.

F. G. Dorais and D. Klyve, A Wieferich prime search up to p < 6.7*10^15, J. Integer Seq. 14 (2011), Art. 11.9.2, 1-14.

R. Fischer, Fermat quotients B^(P-1) == 1 (mod P^2).

W. Keller and J. Richstein, Fermat quotients q_p(a) that are divisible by p.

Mathematica

Select[Prime[Range[1000000]], PowerMod[7, # - 1, #^2] == 1 &] (* Robert Price, May 17 2019 *)

Crossrefs

Cf. A001220, A014127, A123692, A128667, A128668, A090968, A039951, A128669

Sequence in context: A067509 A067502 A318752 * A269527 A111727 A277630

Adjacent sequences: A123690 A123691 A123692 * A123694 A123695 A123696

Keyword

bref,hard,nonn,more

Author

Max Alekseyev, Oct 07 2006

Extensions

Updated by Max Alekseyev, Jan 29 2012

Status

approved