Search: id:A006945 Results 1-1 of 1 results found. %I A006945 M4673 %S A006945 9,2047,1373653,25326001,3215031751,2152302898747,3474749660383, %T A006945 341550071728321,341550071728321 %N A006945 Smallest odd number that requires n Miller-Rabin primality tests. %C A006945 Note that some terms are repeated. %D A006945 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A006945 R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see p. 157. %D A006945 G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp., 61 (1993), 915-926. %D A006945 C. Pomerance, J. L. Selfridge and S. S. Wagstaff, Jr., "The pseudoprimes to 25.10^9", Mathematics of Computation 35 (1980), pp. 1003-1026. %D A006945 S. Wagon, Primality testing, Math. Intellig., 8 (No. 3, 1986), 58-61. %D A006945 Zhenxiang Zhang and Min Tang, "Finding strong pseudoprimes to several bases. II", Mathematics of Computation 72 (2003), pp. 2085-2097. %H A006945 Joerg Arndt, Fxtbook %H A006945 Author?, Finding small prime numbers %H A006945 Index entries for sequences related to pseudoprimes %Y A006945 Same as A014233 except for first term. Cf. A089105, A089825. %Y A006945 Sequence in context: A024125 A039917 A162140 this_sequence A089825 A004820 A162091 %Y A006945 Adjacent sequences: A006942 A006943 A006944 this_sequence A006946 A006947 A006948 %K A006945 nonn %O A006945 1,1 %A A006945 N. J. A. Sloane (njas(AT)research.att.com). %E A006945 Extended and description corrected by Jud McCranie (j.mccranie(AT)comcast.net) Feb 15 1997. %E A006945 Deleted unconfirmed entries that were taken from the "Finding small prime numbers" web page. - Tomasz Czajka (tomekczajka81(AT)gmail.com), Jun 25 2009 Search completed in 0.001 seconds