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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054711 Multiplicative order of 11 mod n, where GCD(n, 11) = 1. 0
1, 1, 2, 2, 1, 2, 3, 2, 6, 1, 2, 2, 12, 3, 2, 4, 16, 6, 3, 2, 6, 2, 22, 2, 5, 12, 18, 6, 28, 2, 30, 8, 3, 16, 3, 6, 6, 3, 12, 2, 40, 6, 7, 3, 6, 22, 46, 4, 21, 5, 16, 12, 26, 18, 2, 6, 6, 28, 58, 2, 4, 30, 6, 16, 12, 3, 66, 16, 22, 3, 70, 6, 72, 6, 10, 6, 4, 12, 39, 4, 54, 40, 41, 6, 16, 7, 28 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

MATHEMATICA

MultiplicativeOrder[11, #] & /@ Select[ Range@ 90, GCD[11, #] == 1 &] (* Robert G. Wilson v, Apr 05 2011 *)

CROSSREFS

Sequence in context: A112204 A129710 A070680 * A193738 A134658 A106580

Adjacent sequences:  A054708 A054709 A054710 * A054712 A054713 A054714

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Apr 20 2000

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 February 14 23:53 EST 2012. Contains 205689 sequences.