login

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”).

A379473
a(n) is the highest power of 3 dividing the sum of divisors of n.
3
1, 3, 1, 1, 3, 3, 1, 3, 1, 9, 3, 1, 1, 3, 3, 1, 9, 3, 1, 3, 1, 9, 3, 3, 1, 3, 1, 1, 3, 9, 1, 9, 3, 27, 3, 1, 1, 3, 1, 9, 3, 3, 1, 3, 3, 9, 3, 1, 3, 3, 9, 1, 27, 3, 9, 3, 1, 9, 3, 3, 1, 3, 1, 1, 3, 9, 1, 9, 3, 9, 9, 3, 1, 3, 1, 1, 3, 3, 1, 3, 1, 9, 3, 1, 27, 3, 3, 9, 9, 9, 1, 3, 1, 9, 3, 9, 1, 9, 3, 1, 3, 27, 1, 3, 3
OFFSET
1,2
FORMULA
Multiplicative with a(p^e) = A038500((p^(e+1)-1)/(p-1)).
a(n) = A038500(A000203(n)).
a(n) = A000244(A354100(n)).
MATHEMATICA
a[n_] := 3^IntegerExponent[DivisorSigma[1, n], 3]; Array[a, 100] (* Amiram Eldar, Dec 27 2024 *)
PROG
(PARI) A379473(n) = (3^valuation(sigma(n), 3));
CROSSREFS
Cf. A329963 (positions of 1's), A087943 (of terms > 1).
Cf. also A082903.
Sequence in context: A134444 A176149 A091442 * A025834 A257379 A336456
KEYWORD
nonn,mult,new
AUTHOR
Antti Karttunen, Dec 27 2024
STATUS
approved