%I #18 Jun 13 2018 03:26:03
%S 9,15,21,35,39,45,63,65,85,91,105,117,133,153,195,221,231,247,259,273,
%T 315,341,357,435,451,455,481,511,561,585,645,651,671,703,763,765,819,
%U 861,873,949,1001,1035,1105,1205,1247,1271,1281,1365,1387,1417,1541,1581
%N Pseudoprimes to base 64.
%C Composite numbers n such that 64^(n-1) == 1 (mod n). - _Michel Lagneau_, Feb 18 2012
%H T. D. Noe, <a href="/A020192/b020192.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 = 64; 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_