login
A247831
Pseudoprimes to base 2 divisible by 3511^2, including the even pseudoprimes.
6
12327121, 129816911251, 259621495381, 346157884801, 605767053061, 6317168754781, 6922923480721, 12634325182441, 18518799663001, 21634109682121, 24273469559431, 57114029344321, 65681131896901, 102718706568661, 135083316211741, 135818875521811, 153342494379361
OFFSET
1,1
COMMENTS
Numbers k such that 2^k == 2 (mod k) and k is divisible by 3511^2.
Unless there are other Wieferich primes (A001220) besides 1093 and 3511, the intersection and the union of this sequence with A247830 are given by A219346 and A158358, respectively, and the even terms are given by A295740. - Max Alekseyev, Nov 26 2017 [The indices of the even terms in this sequence are 430, 525, 543, 701, 811, 826, 937, 1235, 1277, 1388, ... - Jianing Song, Feb 08 2019]
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], 3511^2)==0, print1(vi[n], ", ")))
(PARI) list(N)=select(k->Mod(2, k)^k==2, 3511^2*vector(N\3511^2\2, i, i)) \\ Jianing Song, Feb 07 2019
CROSSREFS
Subsequence of each of (A001567 U A006935), A015919, A158358 composed of the terms divisible by 3511^2.
Sequence in context: A133373 A321987 A288272 * A161592 A164338 A178478
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Sep 24 2014
EXTENSIONS
Name changed by Jianing Song, Feb 07 2019 to include the even pseudoprimes to base 2 (A006935) at the suggestion of Max Alekseyev.
STATUS
approved