login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A252358 Smallest prime p such that (2^n)^(p-1) == 1 (mod p^2), i.e., smallest Wieferich prime to base 2^n. 1
2, 1093, 1093, 3, 1093, 5, 3, 7, 1093, 3, 5, 11, 3, 13, 7, 3, 1093, 17, 3, 19, 5, 3, 11, 23, 3, 5, 13, 3, 7, 29, 3, 31, 1093, 3, 17, 5, 3, 37, 19, 3, 5, 41, 3, 43, 11, 3, 23, 47, 3, 7, 5, 3, 13, 53, 3, 5, 7, 3, 29, 59, 3, 61, 31, 3, 1093, 5, 3, 67, 17, 3, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

This sequence is bounded above by 1093, i.e., a(n) <= 1093 for any n, since any Wieferich prime to base 2 is also Wieferich to any base that is a power of two.

Do all primes <= 1093 appear in this sequence?

From Felix Fröhlich, Dec 10 2020: (Start)

The answer is yes. The smallest n such that a(n) = prime(n) is prime(n). The only exceptions are p = 2 and p = 1093 which first occur at n = 0 and n = 1, respectively.

Apparently, a(n) = 1093 if n is a power of 2 when n < 1093 and a(n) = 1093 if n is prime or a power of 2 when n > 1093. (End)

LINKS

Felix Fröhlich, Table of n, a(n) for n = 0..10000

MATHEMATICA

Block[{k}, Table[k = 1; While[PowerMod[2, n (# - 1), #^2] != 1 &@ Prime@ k, k++]; Prime@ k, {n, 0, 70}] ] (* Michael De Vlieger, Dec 10 2020 *)

PROG

(PARI) a(n) = forprime(p=1, , if(Mod(2, p^2)^(n*(p-1))==1, return(p)))

CROSSREFS

Cf. A001220, A039951.

Sequence in context: A039951 A247072 A282293 * A135618 A241921 A340290

Adjacent sequences:  A252355 A252356 A252357 * A252359 A252360 A252361

KEYWORD

nonn

AUTHOR

Felix Fröhlich, Dec 22 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 29 15:19 EDT 2022. Contains 354913 sequences. (Running on oeis4.)