A247830 Pseudoprimes to base 2 divisible by 1093^2.

1194649, 3914864773, 5654273717, 6523978189, 22178658685, 26092328809, 31310555641, 41747009305, 53053167441, 58706246509, 74795779241, 85667085141, 237865367741, 333967711897, 467032496113, 575310702877, 601401837037, 962329192917, 1087566636885

Offset: 1

Author

Felix Fröhlich, Sep 24 2014

Keywords

• nonn

Comments

Numbers k such that 2^k == 2 (mod k) and k is divisible by 1093^2. - Jianing Song, Apr 07 2019

In contrast to A247831, all terms of this sequence are odd. - Max Alekseyev, Nov 26 2017

Unless there are other Wieferich primes (A001220) besides 1093 and 3511, the intersection and the union of this sequence with A247831 are given by A219346 and A158358, respectively. - Max Alekseyev, Nov 26 2017

Links

• R. G. E. Pinch, The pseudoprimes up to 10^13, Lecture Notes in Computer Science, 1838 (2000), 459-473.
• C. Pomerance, J. L. Selfridge, and S. S. Wagstaff, Jr., The pseudoprimes to 25*10^9, Mathematics of Computation 35 (1980), pp. 1003-1026.

Crossrefs

Subsequence of each of A001567, A015919, A158358 composed of the terms divisible by 1093^2.

Cf. A001220, A013929, A219346, A247831.

Programs

PARI

vi=readvec("b158358.txt")
for(n=1, #vi, if(Mod(vi[n], 1093^2)==0, print1(vi[n], ", ")))