|
| |
|
|
A006945
|
|
Smallest odd number that requires n Miller-Rabin primality tests.
(Formerly M4673)
|
|
2
| |
|
|
9, 2047, 1373653, 25326001, 3215031751, 2152302898747, 3474749660383, 341550071728321, 341550071728321, 3825123056546413051, 3825123056546413051, 3825123056546413051
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| The tests are performed on sequential prime numbers starting with 2. Note that some terms are repeated.
|
|
|
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
| Joerg Arndt, Fxtbook
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.
Eric Bach, Explicit bounds for primality testing and related problems, Mathematics of Computation 55 (1990), pp. 355-380.
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
| Same as A014233 except for first term. Cf. A089105, A089825.
Sequence in context: A024125 A039917 A162140 * A089825 A173281 A004820
Adjacent sequences: A006942 A006943 A006944 * A006946 A006947 A006948
|
|
|
KEYWORD
| nonn,hard,more
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| Extended and description corrected by Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu) Feb 15 1997.
Extended by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Aug 14 2010
|
| |
|
|
