A054711 Multiplicative order of 11 mod n, where gcd(n, 11) = 1.

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

Offset

1,3

Comments

The original version "Number of powers of 11 modulo n" that was similar to A054703-A054717 is now in A351524. - Georg Fischer, Feb 13 2022

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

Cf. A053446 (of 3 mod n), A053448 (5), A053449 (6), A053450 (7), A053452 (9).

Cf. A351524.

Sequence in context: A298857 A070680 A351524 * 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