Smallest odd number that requires n Miller-Rabin primality tests.
9, 2047, 1373653, 25326001, 3215031751, 2152302898747, 3474749660383
4 seqfan posts
Thu Aug 26 19:05:15 CEST 2010 [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Thu Aug 26 18:59:51 CEST 2010 [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Thu Aug 26 17:57:50 CEST 2010 [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Thu Aug 26 13:39:48 CEST 2010 [seqfan] Re: Poll: Sequences Suitable For Crunchers vs. Formula Finding Algorithms
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.