|
|
A020214
|
|
Pseudoprimes to base 86.
|
|
1
|
|
|
15, 51, 65, 85, 87, 145, 221, 255, 377, 435, 451, 493, 561, 595, 703, 1015, 1105, 1479, 1729, 1885, 1891, 2091, 2465, 2755, 2821, 2845, 3091, 3451, 4033, 5365, 5685, 6409, 6601, 7395, 7397, 7483, 7701, 8695, 8911, 9061, 9673, 10585, 10991, 11041, 11305
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Composite numbers n such that 86^(n-1) == 1 (mod n). - Michel Lagneau, Feb 18 2012
|
|
LINKS
|
|
|
MATHEMATICA
|
base = 86; 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 *)
Select[Range[12000], CompositeQ[#]&&PowerMod[86, #-1, #]==1&] (* Harvey P. Dale, Aug 04 2021 *)
|
|
CROSSREFS
|
Cf. A001567 (pseudoprimes to base 2).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|