%I A020139
%S A020139 10,15,70,133,190,259,305,481,645,703,793,1105,1330,1729,2047,2257,2465,
%T A020139 2821,4577,4921,5041,5185,6601,7869,8113,8170,8695,8911,9730,10585,12403,
%U A020139 13333,14521,14981,15841,16705,17711,18705,23377,24130,24727,26335,26467
%N A020139 Pseudoprimes to base 11.
%C A020139 According to Karsten Meyer (arbol01(AT)gmx.de), May 16 2006, 10 should 
               be excluded, following the strict definition in Crandall and Pomerance.
%D A020139 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)
%D A020139 J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 190, p. 57, Ellipses, 
               Paris 2008.
%H A020139 R. J. Mathar, <a href="b020139.txt">Table of n, a(n) for n=1..726</a>
%H A020139 F. Richman, <a href="http://www.math.fau.edu/Richman/carm.htm">Primality 
               testing with Fermat's little theorem</a>
%H A020139 <a href="Sindx_Ps.html#pseudoprimes">Index entries for sequences related 
               to pseudoprimes</a>
%Y A020139 Sequence in context: A119039 A047189 A035407 this_sequence A056522 A056511 
               A166626
%Y A020139 Adjacent sequences: A020136 A020137 A020138 this_sequence A020140 A020141 
               A020142
%K A020139 nonn
%O A020139 1,1
%A A020139 David W. Wilson (davidwwilson(AT)comcast.net)