%I #18 Jun 13 2018 09:17:58
%S 65,91,335,469,481,871,1105,1271,1541,1729,1891,2071,2201,2465,2821,
%T 2911,3145,4033,4291,4355,4681,5461,5551,6097,6601,6953,7969,8911,
%U 9211,9919,10585,11305,11647,13019,13741,15211,15841,17353,19345,19757,20591,21785
%N Pseudoprimes to base 66.
%C Composite numbers n such that 66^(n-1) == 1 (mod n). - _Michel Lagneau_, Feb 18 2012
%H T. D. Noe, <a href="/A020194/b020194.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>
%t base = 66; t = {}; n = 1; While[Length[t] < 100, n++; If[! PrimeQ[n] && PowerMod[base, n-1, n] == 1, AppendTo[t, n]]]; t (* _T. D. Noe_, Feb 21 2012 *)
%Y Cf. A001567 (pseudoprimes to base 2).
%K nonn
%O 1,1
%A _David W. Wilson_