cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A344522 a(n) = Sum_{1 <= i, j, k <= n} gcd(i,j,k).

Original entry on oeis.org

1, 9, 30, 76, 141, 267, 400, 624, 885, 1249, 1590, 2208, 2689, 3411, 4248, 5248, 6081, 7485, 8530, 10248, 11889, 13687, 15228, 17988, 20053, 22569, 25242, 28588, 31053, 35463, 38284, 42540, 46581, 50893, 55362, 61824, 65857, 71247, 76884, 84388, 89349, 97881, 103342
Offset: 1

Views

Author

Seiichi Manyama, May 22 2021

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Sum[EulerPhi[k] * Quotient[n, k]^3, {k, 1, n}]; Array[a, 50] (* Amiram Eldar, May 22 2021 *)
  • PARI
    a(n) = sum(i=1, n, sum(j=1, n, sum(k=1, n, gcd([i, j, k]))));
    
  • PARI
    a(n) = sum(k=1, n, eulerphi(k)*(n\k)^3);
    
  • PARI
    my(N=66, x='x+O('x^N)); Vec(sum(k=1, N, eulerphi(k)*x^k*(1+4*x^k+x^(2*k))/(1-x^k)^3)/(1-x))

Formula

a(n) = Sum_{k=1..n} phi(k) * floor(n/k)^3.
G.f.: (1/(1 - x)) * Sum_{k >= 1} phi(k) * x^k * (1 + 4*x^k + x^(2*k))/(1 - x^k)^3.
a(n) ~ Pi^2 * n^3 / (6*zeta(3)). - Vaclav Kotesovec, May 23 2021