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!)
A309322 Expansion of Sum_{k>=1} phi(k) * x^k/(1 - x^k)^3, where phi = Euler totient function (A000010). 5
1, 4, 8, 15, 19, 35, 34, 56, 63, 86, 76, 141, 103, 157, 182, 212, 169, 294, 208, 355, 335, 359, 298, 556, 405, 490, 522, 657, 463, 865, 526, 816, 773, 812, 856, 1239, 739, 1003, 1058, 1424, 901, 1610, 988, 1525, 1617, 1445, 1174, 2188, 1435, 1960, 1760, 2091, 1483, 2529, 1994 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Dirichlet convolution of Euler totient function with triangular numbers.
LINKS
FORMULA
a(n) = Sum_{d|n} phi(n/d) * d * (d + 1)/2.
a(n) = Sum_{k=1..n} Sum_{j=1..k} gcd(j,k,n).
a(n) = Sum_{k=1..n} gcd(n,k)*(gcd(n,k)+1)/2. - Richard L. Ollerton, May 07 2021
Sum_{k=1..n} a(k) ~ Pi^2 * n^3 / (36*zeta(3)). - Vaclav Kotesovec, May 23 2021
MATHEMATICA
nmax = 55; CoefficientList[Series[Sum[EulerPhi[k] x^k/(1 - x^k)^3, {k, 1, nmax}], {x, 0, nmax}], x] // Rest
Table[Sum[EulerPhi[n/d] d (d + 1)/2, {d, Divisors[n]}], {n, 1, 55}]
Table[Sum[Sum[GCD[j, k, n], {j, 1, k}], {k, 1, n}], {n, 1, 55}]
CROSSREFS
Sequence in context: A267368 A345096 A190692 * A312744 A312745 A312746
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jul 23 2019
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 April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)