

A274175


Composite numbers c that set a new record for the number of bases b with 1 < b < c such that c satisfies b^(c1) == 1 (mod c^2), i.e., such that c is a baseb "Wieferich pseudoprime".


0




OFFSET

1,1


COMMENTS

a(4) > 253263 if it exists.
Is the sequence infinite?
Let x be the integer sequence defined as x(n) = number of bases 1 < b < c such that c is a baseb "Wieferich pseudoprime", where c is the nth composite number (that sequence does not have its own entry in the OEIS). Then a(n) is the sequence of composites where x(n) reaches record values.
Let y be the integer sequence defined as y(n) = smallest composite c with exactly n bases 1 < b < c such that c is a baseb "Wieferich pseudoprime". Is a(n) = y(n) for all n?
For every b with 1 < b < c such that c is a baseb "Wieferich pseudoprime", every prime factor p of c is a baseb Wieferich prime.


LINKS

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


EXAMPLE

c = 141373 satisfies b^(c1) == 1 (mod c^2) for three values of b with 1 < b < c, namely b = 23382, 36620 and 130595. Since no other composite c < 141373 exists that has more than two such b, 141373 is a term of the sequence.


PROG

(PARI) my(r=0, i); forcomposite(c=1, , i=0; for(b=2, c1, if(Mod(b, c^2)^(c1)==1, i++)); if(i > r, print1(c, ", "); r=i))


CROSSREFS

Cf. A194946, A248865, A256517, A267288.
Sequence in context: A020237 A217690 A117565 * A038491 A020265 A028295
Adjacent sequences: A274172 A274173 A274174 * A274176 A274177 A274178


KEYWORD

nonn,hard,more,bref


AUTHOR

Felix FrÃ¶hlich, Jun 12 2016


STATUS

approved



