|
Search: id:A020147
|
|
|
| A020147 |
|
Pseudoprimes to base 19. |
|
+0
2
|
|
| 6, 9, 15, 18, 45, 49, 153, 169, 343, 561, 637, 889, 905, 906, 1035, 1105, 1629, 1661, 1849, 1891, 2353, 2465, 2701, 2821, 2955, 3201, 4033, 4681, 5461, 5466, 5713, 6223, 6541, 6601, 6697, 7957, 8145, 8281, 8401, 8869, 9211, 9997, 10021, 10515, 10585
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
According to Karsten Meyer (arbol01(AT)gmx.de), May 16 2006, 6, 9 and 18 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..977
F. Richman, Primality testing with Fermat's little theorem
Index entries for sequences related to pseudoprimes
|
|
CROSSREFS
|
Sequence in context: A139322 A139321 A020648 this_sequence A164383 A001748 A097426
Adjacent sequences: A020144 A020145 A020146 this_sequence A020148 A020149 A020150
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
