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

A062952
Multiplicative with a(p^e) = (p^(2*e+2)-p^(e+1)-p^e+p)/(p^2-1).
12
1, 4, 9, 18, 25, 36, 49, 78, 87, 100, 121, 162, 169, 196, 225, 326, 289, 348, 361, 450, 441, 484, 529, 702, 645, 676, 807, 882, 841, 900, 961, 1334, 1089, 1156, 1225, 1566, 1369, 1444, 1521, 1950, 1681, 1764, 1849, 2178, 2175, 2116, 2209, 2934, 2443, 2580
OFFSET
1,2
COMMENTS
If k is squarefree (cf. A005117) then A062952(k) = k^2. - Benoit Cloitre, Apr 16 2002
LINKS
FORMULA
a(n) = Sum_{d|n} phi(d)*sigma(d).
a(n) = Sum_{k=1..n} sigma(n/gcd(n, k)).
Sum_{k=1..n} a(k) ~ c * n^3, where c = (zeta(2)*zeta(3)/3) * Product_{p prime} (1 - 1/p^2 - 1/p^3 + 1/p^4) = A183699 * A330523 / 3. - Amiram Eldar, Oct 30 2022
MATHEMATICA
f[p_, e_] := (p^(2*e+2)-p^(e+1)-p^e+p)/(p^2-1); a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 50] (* Amiram Eldar, Jul 31 2019 *)
PROG
(PARI) a(n) = sumdiv(n, d, eulerphi(d)*sigma(d)) \\ Michel Marcus, Jun 17 2013
KEYWORD
nonn,mult
AUTHOR
Vladeta Jovovic, Jul 21 2001
STATUS
approved