A054707 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A054707

Number of powers of 6 modulo n.

1, 2, 2, 3, 1, 2, 2, 4, 3, 2, 10, 3, 12, 3, 2, 5, 16, 3, 9, 3, 3, 11, 11, 4, 5, 13, 4, 4, 14, 2, 6, 6, 11, 17, 2, 3, 4, 10, 13, 4, 40, 3, 3, 12, 3, 12, 23, 5, 14, 6, 17, 14, 26, 4, 10, 5, 10, 15, 58, 3, 60, 7, 4, 7, 12, 11, 33, 18, 12, 3, 35, 4, 36, 5, 6, 11, 10, 13, 78, 5, 5, 41, 82, 4, 16

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from David W. Wilson)

FORMULA

a(n) = A007737(n) + A244417(n). - Amiram Eldar, Aug 25 2024

MATHEMATICA

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

CROSSREFS

Cf. A007737, A244417.

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

Sequence in context: A276150 A275729 A236920 * A325518 A282863 A308662

Adjacent sequences: A054704 A054705 A054706 * A054708 A054709 A054710

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley, Apr 20 2000

STATUS

approved