[go: up one dir, main page]

login
A054705
Number of powers of 4 modulo n.
15
1, 2, 1, 2, 2, 2, 3, 3, 3, 3, 5, 2, 6, 4, 2, 3, 4, 4, 9, 3, 3, 6, 11, 3, 10, 7, 9, 4, 14, 3, 5, 4, 5, 5, 6, 4, 18, 10, 6, 4, 10, 4, 7, 6, 6, 12, 23, 3, 21, 11, 4, 7, 26, 10, 10, 5, 9, 15, 29, 3, 30, 6, 3, 4, 6, 6, 33, 5, 11, 7, 35, 5, 9, 19, 10, 10, 15, 7, 39, 4, 27, 11, 41, 4, 4, 8, 14, 7, 11
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) = A007735(n) + A244415(n). - Amiram Eldar, Aug 25 2024
MATHEMATICA
a[n_] := IntegerExponent[2*n, 4] + MultiplicativeOrder[4, n/2^IntegerExponent[n, 2]]; Array[a, 100] (* Amiram Eldar, Aug 25 2024 *)
CROSSREFS
Cf. A054703 (base 2), A054704 (3), A054706 (5), A054707 (6), A054708 (7), A054709 (8), A054717 (9), A054710 (10), A351524 (11), A054712 (12), A054713 (13), A054714 (14), A054715 (15), A054716 (16).
Sequence in context: A064065 A284486 A232194 * A025800 A029258 A280128
KEYWORD
easy,nonn
AUTHOR
Henry Bottomley, Apr 20 2000
STATUS
approved