login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111076 Smallest number of maximal order mod n. 0
0, 1, 2, 3, 2, 5, 3, 3, 2, 3, 2, 5, 2, 3, 2, 3, 3, 5, 2, 3, 2, 7, 5, 5, 2, 7, 2, 3, 2, 7, 3, 3, 2, 3, 2, 5, 2, 3, 2, 3, 6, 5, 3, 3, 2, 5, 5, 5, 3, 3, 5, 7, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 7, 5, 5, 5, 2, 3, 2, 7, 3, 3, 2, 7, 2, 5, 3, 3, 2, 3, 3, 7, 2, 3, 11, 5, 2, 5, 5, 3, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

EXAMPLE

a(6)=5 because order of 1 is 1 and 2 through 4 are not relatively prime, but 5 has order 2, which is the maximum possible.

CROSSREFS

Cf. A002322 (orders); same as A046145 for n with primitive roots; see also A001918 (for primes).

Sequence in context: A064886 A029600 A169616 * A162398 A131470 A026235

Adjacent sequences:  A111073 A111074 A111075 * A111077 A111078 A111079

KEYWORD

easy,nonn

AUTHOR

Franklin T. Adams-Watters, Oct 10 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified June 20 06:12 EDT 2013. Contains 226422 sequences.