OFFSET
1,2
COMMENTS
Sum of squares of divisors d of n such that n/d is square.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..10000
FORMULA
G.f.: Sum_{k>=1} k^2 * (theta_3(x^k) - 1)/2.
Dirichlet g.f.: zeta(2*s) * zeta(s-2).
a(n) = Sum_{d|n} A010052(n/d) * d^2.
a(n) = Sum_{d|n} |A076792(d)|.
a(p) = p^2, where p is prime.
Sum_{k=1..n} a(k) ~ Pi^6 * n^3 / 2835. - Vaclav Kotesovec, Oct 11 2019
Multiplicative with a(p^e) = Sum_{i=0..floor(e/2)} p^(2*e-4*i) for prime p, i.e., a(p^(2*e)) = (p^(4*e+4)-1)/(p^4-1) and a(p^(2*e+1)) = p^2 * (p^(4*e+4)-1)/(p^4-1) for prime p. - Werner Schulte, Jul 24 2021
MAPLE
a:= n-> add((n/d)^2, d=select(issqr, numtheory[divisors](n))):
seq(a(n), n=1..60); # Alois P. Heinz, Oct 11 2019
MATHEMATICA
nmax = 55; CoefficientList[Series[Sum[x^(k^2) (1 + x^(k^2))/(1 - x^(k^2))^3, {k, 1, Floor[Sqrt[nmax]] + 1}], {x, 0, nmax}], x] // Rest
Table[DivisorSum[n, #^2 &, IntegerQ[Sqrt[n/#]] &], {n, 1, 55}]
PROG
(Magma) [&+[d^2:d in Divisors(n)| IsSquare(n div d)]:n in [1..55]]; // Marius A. Burtea, Oct 10 2019
(PARI) a(n) = sumdiv(n, d, if (issquare(n/d), d^2)); \\ Michel Marcus, Oct 12 2019
CROSSREFS
KEYWORD
nonn,mult
AUTHOR
Ilya Gutkovskiy, Oct 10 2019
STATUS
approved