|
%I #13 Aug 03 2014 14:01:11
%S 9,34,51,153,341,442,561,782,1247,1261,1581,1921,2278,2431,2701,2871,
%T 3298,3601,4371,5083,5161,5517,7543,7633,7969,8398,10421,11041,12403,
%U 13051,13833,14689,15051,16441,16589,17391,19006,19041,19951,20026,22681
%N Pseudoprimes to base 35.
%C Composite numbers n such that 35^(n-1) == 1 (mod n).
%H T. D. Noe, <a href="/A020163/b020163.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 = 35; 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_
|
