A242741 Primes p such that p^2 divides 15^(p-1) - 1.

29131, 119327070011

Offset

1,1

Comments

Base 15 Wieferich primes. According to Richard Fischer there is no other term up to approximately 5*10^13.

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.

R. Fischer, Thema: Fermatquotient B^(P-1) == 1 (mod P^2)

Mathematica

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

Prog

(PARI)
forprime(n=2, 10^9, if(Mod(15, n^2)^(n-1)==1, print1(n, ", ")));

Crossrefs

Cf. A001220, A014127, A123692, A212583, A123693, A045616, A111027, A128667, A234810

Sequence in context: A249465 A257391 A015313 * A152939 A028462 A357272

Adjacent sequences: A242738 A242739 A242740 * A242742 A242743 A242744

Keyword

nonn,hard,bref,more

Author

Felix Fröhlich, May 21 2014

Status

approved