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!)
A054711 Multiplicative order of 11 mod n, where gcd(n, 11) = 1. 0
1, 1, 2, 2, 1, 2, 3, 2, 6, 1, 2, 12, 3, 2, 4, 16, 6, 3, 2, 6, 22, 2, 5, 12, 18, 6, 28, 2, 30, 8, 16, 3, 6, 6, 3, 12, 2, 40, 6, 7, 6, 22, 46, 4, 21, 5, 16, 12, 26, 18, 6, 6, 28, 58, 2, 4, 30, 6, 16, 12, 66, 16, 22, 3, 70, 6, 72, 6, 10, 6, 12, 39, 4, 54, 40, 41 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

MATHEMATICA

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

PROG

(PARI) lista(nn) = {for(n=1, nn, if (gcd(n, 11) == 1, print1(znorder(Mod(11, n)), ", ")); ); } \\ Michel Marcus, Feb 09 2015

CROSSREFS

Sequence in context: A129710 A298857 A070680 * A241424 A334671 A294232

Adjacent sequences:  A054708 A054709 A054710 * A054712 A054713 A054714

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley, Apr 20 2000

EXTENSIONS

Corrected by Michel Marcus, Feb 11 2015

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 October 25 17:22 EDT 2021. Contains 348255 sequences. (Running on oeis4.)