id:A111076 - OEIS Search Results

Search: id:A111076

Displaying 1-1 of 1 results found.

page 1

Smallest number of maximal order mod n.

+0
1

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; listen)

	OFFSET	`1,3`
	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: A104887 A064886 A029600 this_sequence A131470 A026235 A086281` `Adjacent sequences: A111073 A111074 A111075 this_sequence A111077 A111078 A111079`
	KEYWORD	`easy,nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), Oct 10 2005`

page 1

Search completed in 0.002 seconds

Last modified August 28 11:49 EDT 2008. Contains 143094 sequences.

AT&T Labs Research