login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A256565 Smallest base b > 1 such that the smallest base-b Wieferich prime p (i.e., prime p satisfying b^(p-1) == 1 mod (p^2)) lies between 10^n and 10^(n+1). 0
5, 3, 20, 2, 6, 142, 183, 66, 294, 88, 34, 387 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

In other words, the smallest base b where the smallest base-b Wieferich prime has exactly n+1 digits; i.e., a(n) is the smallest b > 1 such that A055642(A039951(b)) = n+1.

LINKS

Table of n, a(n) for n=0..11.

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

PROG

(PARI) for(n=0, 20, b=2; goodwief=0; while(goodwief==0, badwief=0; forprime(p=1, 10^n, if(Mod(b, p^2)^(p-1)==1, badwief++; break({1}))); if(badwief==0, forprime(p=10^n, 10^(n+1), if(Mod(b, p^2)^(p-1)==1, print1(b, ", "); goodwief++; break({1})))); b++))

CROSSREFS

Cf. A039951.

Sequence in context: A169697 A092525 A101367 * A298098 A248256 A049457

Adjacent sequences:  A256562 A256563 A256564 * A256566 A256567 A256568

KEYWORD

nonn,hard,more

AUTHOR

Felix Fröhlich, Apr 02 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 07:00 EST 2019. Contains 329948 sequences. (Running on oeis4.)