OFFSET
1,2
COMMENTS
Dirichlet convolution of Euler totient function with triangular numbers.
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 1..10000
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
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jul 23 2019
STATUS
approved
