Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #15 Apr 19 2019 11:26:44
%S 1194649,3914864773,5654273717,6523978189,22178658685,26092328809,
%T 31310555641,41747009305,53053167441,58706246509,74795779241,
%U 85667085141,237865367741,333967711897,467032496113,575310702877,601401837037,962329192917,1087566636885
%N Pseudoprimes to base 2 divisible by 1093^2.
%C Numbers k such that 2^k == 2 (mod k) and k is divisible by 1093^2. - _Jianing Song_, Apr 07 2019
%C In contrast to A247831, all terms of this sequence are odd. - _Max Alekseyev_, Nov 26 2017
%C 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
%H R. G. E. Pinch, <a href="http://dx.doi.org/10.1007/10722028_30">The pseudoprimes up to 10^13</a>, Lecture Notes in Computer Science, 1838 (2000), 459-473.
%H C. Pomerance, J. L. Selfridge, and S. S. Wagstaff, Jr., <a href="http://dx.doi.org/10.1090/S0025-5718-1980-0572872-7">The pseudoprimes to 25*10^9</a>, Mathematics of Computation 35 (1980), pp. 1003-1026.
%o (PARI) vi=readvec("b158358.txt")
%o for(n=1, #vi, if(Mod(vi[n], 1093^2)==0, print1(vi[n], ", ")))
%Y Subsequence of each of A001567, A015919, A158358 composed of the terms divisible by 1093^2.
%Y Cf. A001220, A013929, A219346, A247831.
%K nonn
%O 1,1
%A _Felix Fröhlich_, Sep 24 2014