login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A372226 a(n) = Sum_{k=1..n} sigma_2( n/gcd(k,n) ). 1
1, 6, 21, 48, 105, 126, 301, 388, 567, 630, 1221, 1008, 2041, 1806, 2205, 3116, 4641, 3402, 6517, 5040, 6321, 7326, 11661, 8148, 13125, 12246, 15327, 14448, 23577, 13230, 28861, 24956, 25641, 27846, 31605, 27216, 49321, 39102, 42861, 40740, 67281, 37926 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{d|n} phi(d) * sigma_2(d).
From Amiram Eldar, May 20 2024: (Start)
Multiplicative with a(p^e) = (p^(3*e+5) - p^(3*e+4) - p^(e+3) + p^e + p^4 - p^2) / ((p^2 - 1) * (p^3 - 1)).
Sum_{k=1..n} a(k) ~ c * n^4 / 4, where c = zeta(3) * zeta(4) * Product_{p prime} (1 - 1/p^2 - 1/p^4 + 1/p^5) = 0.749582840863254826301... . (End)
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[#] * DivisorSigma[2, #] &]; Array[a, 100] (* Amiram Eldar, May 20 2024 *)
PROG
(PARI) a(n) = sumdiv(n, d, eulerphi(d)*sigma(d, 2));
CROSSREFS
Cf. A064987.
Sequence in context: A212707 A267370 A213388 * A163715 A028345 A357691
KEYWORD
nonn,mult
AUTHOR
Seiichi Manyama, May 19 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 6 20:42 EDT 2024. Contains 374983 sequences. (Running on oeis4.)