%I A020141
%S A020141 4,6,12,21,85,105,231,244,276,357,427,561,1099,1785,1891,2465,2806,3605,
%T A020141 5028,5149,5185,5565,6601,7107,8841,8911,9577,9637,10308,10585,11305,
%U A020141 12403,12621,13019,13345,13461,13685,14491,14981,15051,15505,15841,17803
%N A020141 Pseudoprimes to base 13.
%C A020141 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.
%D A020141 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)
%H A020141 R. J. Mathar, <a href="b020141.txt">Table of n, a(n) for n=1..788</a>
%H A020141 <a href="Sindx_Ps.html#pseudoprimes">Index entries for sequences related 
               to pseudoprimes</a>
%H A020141 F. Richman, <a href="http://www.math.fau.edu/Richman/carm.htm">Primality 
               testing with Fermat's little theorem</a>
%Y A020141 Sequence in context: A110935 A128034 A027150 this_sequence A049478 A163776 
               A050558
%Y A020141 Adjacent sequences: A020138 A020139 A020140 this_sequence A020142 A020143 
               A020144
%K A020141 nonn
%O A020141 1,1
%A A020141 David W. Wilson (davidwwilson(AT)comcast.net)