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

A370240
The sum of divisors of n that are cubes of squarefree numbers.
2
1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 28, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 28, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 9, 28, 1, 1, 1, 1, 1
OFFSET
1,8
COMMENTS
First differs from A366904 at n = 32, and from A113061 at n = 64.
LINKS
FORMULA
Multiplicative with a(p^e) = 1 for e <= 2, and a(p^e) = 1 + p^3 for e >= 3.
Dirichlet g.f.: zeta(s)*zeta(3*s-3)/zeta(6*s-6).
Sum_{k=1..n} a(k) ~ c * n^(4/3) + n, where c = 3*zeta(4/3)/(2*Pi^2) = 0.5472769126... .
MATHEMATICA
f[p_, e_] := If[e <= 2, 1, 1 + p^3]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
PROG
(PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i, 2] <= 2, 1, 1 + f[i, 1]^3)); }
CROSSREFS
KEYWORD
nonn,easy,mult
AUTHOR
Amiram Eldar, Feb 13 2024
STATUS
approved