login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A066501
Numbers k such that x^6 == 1 (mod(k)) has no solution 1 < x < k-1.
5
1, 2, 3, 4, 5, 6, 10, 11, 17, 22, 23, 25, 29, 34, 41, 46, 47, 50, 53, 58, 59, 71, 82, 83, 89, 94, 101, 106, 107, 113, 118, 121, 125, 131, 137, 142, 149, 166, 167, 173, 178, 179, 191, 197, 202, 214, 226, 227, 233, 239, 242, 250, 251, 257, 262, 263, 269, 274, 281, 289, 293
OFFSET
1,2
FORMULA
Sequence consists of the numbers 4, 6 and for all k > 1, A045309(k), 2*A045309(k), A045309(k)^2, 2*A045309(k)^2.
PROG
(PARI) isok(n) = {for (x=2, n-2, if ((Mod(x, n)^6) == Mod(1, n), return (0)); ); return (1); } \\ Michel Marcus, Nov 20 2013
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 04 2002
EXTENSIONS
Extended by Ray Chandler, Nov 06 2003
Terms 1, 2 and 3 prepended by Michel Marcus, Nov 20 2013
STATUS
approved