|
Search: id:A020141
|
|
|
| A020141 |
|
Pseudoprimes to base 13. |
|
+0
2
|
|
| 4, 6, 12, 21, 85, 105, 231, 244, 276, 357, 427, 561, 1099, 1785, 1891, 2465, 2806, 3605, 5028, 5149, 5185, 5565, 6601, 7107, 8841, 8911, 9577, 9637, 10308, 10585, 11305, 12403, 12621, 13019, 13345, 13461, 13685, 14491, 14981, 15051, 15505, 15841, 17803
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
According to Karsten Meyer (arbol01(AT)gmx.de), May 16 2006, 4, 6 and 12 should be excluded, following the strict definition in Crandall and Pomerance.
|
|
REFERENCES
|
R. Crandall and C. Pomerance, "Prime Numbers - A Computational Perspective", Second Edition, Springer Verlag 2005, ISBN 0-387-25282-7 Page 132 (Theorem 3.4.2. and Algorithm 3.4.3)
|
|
LINKS
|
R. J. Mathar, Table of n, a(n) for n=1..788
Index entries for sequences related to pseudoprimes
F. Richman, Primality testing with Fermat's little theorem
|
|
CROSSREFS
|
Sequence in context: A110935 A128034 A027150 this_sequence A049478 A163776 A050558
Adjacent sequences: A020138 A020139 A020140 this_sequence A020142 A020143 A020144
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
