|
%I #18 Jun 13 2018 08:31:58
%S 21,69,91,105,161,169,345,483,485,645,805,1105,1183,1247,1261,1541,
%T 1649,1729,1891,2037,2041,2047,2413,2465,2737,2821,3241,3605,3801,
%U 5551,5565,5963,6019,6601,6693,7081,7107,7267,7665,8119,8365,8421,8911,9453,10185
%N Pseudoprimes to base 22.
%C Composite numbers n such that 22^(n-1) == 1 (mod n). - _Michel Lagneau_, Feb 18 2012
%H T. D. Noe, <a href="/A020150/b020150.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 = 22; 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_
|
