

A006945


Smallest odd number that requires n MillerRabin primality tests.
(Formerly M4673)


2



9, 2047, 1373653, 25326001, 3215031751, 2152302898747, 3474749660383, 341550071728321, 341550071728321, 3825123056546413051, 3825123056546413051, 3825123056546413051
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

The tests are performed on sequential prime numbers starting with 2. Note that some terms are repeated.
Same as A014233 except for the first term.


REFERENCES

R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see p. 157.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS

Table of n, a(n) for n=1..12.
Joerg Arndt, Matters Computational (The Fxtbook)
Eric Bach, Explicit bounds for primality testing and related problems, Mathematics of Computation 55 (1990), pp. 355380.
G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp., 61 (1993), 915926.
Yupeng Jiang, Yingpu Deng, Strong pseudoprimes to the first 9 prime bases, arXiv:1207.0063v1 [math.NT], June 30, 2012.
C. Pomerance, J. L. Selfridge and S. S. Wagstaff, Jr., The pseudoprimes to 25.10^9, Mathematics of Computation 35 (1980), pp. 10031026.
S. Wagon, Primality testing, Math. Intellig., 8 (No. 3, 1986), 5861.
Zhenxiang Zhang and Min Tang, Finding strong pseudoprimes to several bases. II, Mathematics of Computation 72 (2003), pp. 20852097.
Index entries for sequences related to pseudoprimes


FORMULA

Bach shows that, on the ERH, a(n) >> exp(sqrt(1/2 * x log x)). [Charles R Greathouse IV, May 17, 2011]


CROSSREFS

Cf. A089105, A089825.
Sequence in context: A232684 A039917 A162140 * A089825 A173281 A004820
Adjacent sequences: A006942 A006943 A006944 * A006946 A006947 A006948


KEYWORD

nonn,hard,more


AUTHOR

N. J. A. Sloane.


EXTENSIONS

Extended and description corrected by Jud McCranie Feb 15 1997.
a(10)a(12) from Charles R Greathouse IV, Aug 14 2010


STATUS

approved



