1,1

Note that some terms are repeated.

R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see p. 157.

G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp., 61 (1993), 915-926.

C. Pomerance, J. L. Selfridge and S. S. Wagstaff, Jr., "The pseudoprimes to 25.10^9", Mathematics of Computation 35 (1980), pp. 1003-1026.

S. Wagon, Primality testing, Math. Intellig., 8 (No. 3, 1986), 58-61.

Zhenxiang Zhang and Min Tang, "Finding strong pseudoprimes to several bases. II", Mathematics of Computation 72 (2003), pp. 2085-2097.

Joerg Arndt, Fxtbook

A. J. Menezes, P. C. van Oorschot and S. A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996; see section 4.2.3, Miller-Rabin test.

F. Raynal, Miller-Rabin's Primality Test

K. Reinhardt, Miller-Rabin Primality Test for odd n

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

Wikipedia, Miller-Rabin primality test

Author?, Finding small prime numbers

Index entries for sequences related to pseudoprimes

Same as A006945 except for first term.

Sequence in context: A075950 A022527 A024009 this_sequence A022193 A069386 A069412

Adjacent sequences: A014230 A014231 A014232 this_sequence A014234 A014235 A014236

nonn

Jud McCranie (j.mccranie(AT)comcast.net) Feb 15 1997

Minor edits from N. J. A. Sloane, Jun 20 2009

Deleted unconfirmed entries that were taken from the "Finding small prime numbers" web page. - Tomasz Czajka (tomekczajka81(AT)gmail.com), Jun 25 2009