login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066501 Numbers n such that x^6=1 mod(n) has no solution 1<x<n-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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..61.

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

Cf. A045309, A066498, A066499, A066500, A066502, A000010.

Sequence in context: A056910 A212774 A131934 * A199191 A102570 A113007

Adjacent sequences:  A066498 A066499 A066500 * A066502 A066503 A066504

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 7 11:05 EDT 2020. Contains 333301 sequences. (Running on oeis4.)