|
Search: id:A020139
|
|
|
| A020139 |
|
Pseudoprimes to base 11. |
|
+0
2
|
|
| 10, 15, 70, 133, 190, 259, 305, 481, 645, 703, 793, 1105, 1330, 1729, 2047, 2257, 2465, 2821, 4577, 4921, 5041, 5185, 6601, 7869, 8113, 8170, 8695, 8911, 9730, 10585, 12403, 13333, 14521, 14981, 15841, 16705, 17711, 18705, 23377, 24130, 24727, 26335, 26467
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
According to Karsten Meyer (arbol01(AT)gmx.de), May 16 2006, 10 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)
J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 190, p. 57, Ellipses, Paris 2008.
|
|
LINKS
|
R. J. Mathar, Table of n, a(n) for n=1..85
F. Richman, Primality testing with Fermat's little theorem
Index entries for sequences related to pseudoprimes
|
|
CROSSREFS
|
Sequence in context: A119039 A047189 A035407 this_sequence A056522 A056511 A114703
Adjacent sequences: A020136 A020137 A020138 this_sequence A020140 A020141 A020142
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
