OFFSET
1,1
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.
PROG
(PARI) vi=readvec("b158358.txt")
for(n=1, #vi, if(Mod(vi[n], 1093^2)==0, print1(vi[n], ", ")))
CROSSREFS
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Sep 24 2014
STATUS
approved