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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066858 Smallest k>1 such that for each integer x, x^k=x or x^k=0 (mod n); or 0 if no such k exists. 0
 2, 3, 3, 5, 3, 7, 3, 7, 5, 11, 0, 13, 7, 5, 5, 17, 0, 19, 0, 7, 11, 23, 0, 21, 13, 19, 0, 29, 5, 31, 9, 11, 17, 13, 0, 37, 19, 13, 0, 41, 7, 43, 0, 0, 23, 47, 0, 43, 0, 17, 0, 53, 0, 21, 0, 19, 29, 59, 0, 61, 31, 0, 17, 13, 11, 67, 0, 23, 13, 71, 0, 73, 37, 0, 0, 31, 13, 79, 0, 55, 41 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS By Fermat's little theorem if k exists then k <= n (with equality only if n prime). All terms that are 0 are not squarefree and not prime powers. - Larry Reeves LINKS CROSSREFS Sequence in context: A117531 A275940 A105555 * A333496 A152864 A152984 Adjacent sequences:  A066855 A066856 A066857 * A066859 A066860 A066861 KEYWORD nonn AUTHOR Roger CuculiÃ¨re, Jan 22 2002 EXTENSIONS More terms from Larry Reeves (larryr(AT)acm.org), Jun 11 2002 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.

Last modified June 7 02:48 EDT 2020. Contains 334836 sequences. (Running on oeis4.)