A020194 revision #15
|
|
A020194
|
|
Pseudoprimes to base 66.
|
|
1
|
|
|
65, 91, 335, 469, 481, 871, 1105, 1271, 1541, 1729, 1891, 2071, 2201, 2465, 2821, 2911, 3145, 4033, 4291, 4355, 4681, 5461, 5551, 6097, 6601, 6953, 7969, 8911, 9211, 9919, 10585, 11305, 11647, 13019, 13741, 15211, 15841, 17353, 19345, 19757, 20591, 21785
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Composite numbers n such that 66^(n-1) == 1 (mod n). [From Michel Lagneau, Feb 18 2012]
|
|
LINKS
|
|
|
MATHEMATICA
|
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 *)
|
|
CROSSREFS
|
Cf. A001567 (pseudoprimes to base 2).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|