A351524 Number of powers of 11 modulo n.

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

Offset: 1

Author

Georg Fischer, Feb 13 2022

Keywords

• nonn
• easy

Comments

This is the original version of A054711 rev. #1 as defined by Henry Bottomley, Apr 20 2000.

A054711 is now different from the sequence here.

Links

• Alois P. Heinz, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A054711.

Cf. A054703 (base 2), A054704 (3), A054705 (4), A054706 (5), A054707 (6), A054708 (7), A054709 (8), A054717 (9), A054710 (10), A054712 (12), A054713 (13), A054714 (14), A054715 (15), A054716 (16).

Programs

Mathematica

a[n_] := Module[{e = IntegerExponent[n, 11]}, e + MultiplicativeOrder[11, n/11^e]]; Array[a, 100] (* Amiram Eldar, Aug 25 2024 *)