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.

A342433 a(n) = Sum_{k=1..n} gcd(k,n)^(n-1).

Original entry on oeis.org

1, 3, 11, 74, 629, 8085, 117655, 2113796, 43059849, 1001955177, 25937424611, 743379914746, 23298085122493, 793811662313709, 29192938251553759, 1152956691126550536, 48661191875666868497, 2185928270773974154773
Offset: 1

Views

Author

Seiichi Manyama, Mar 12 2021

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := Sum[GCD[k, n]^(n - 1), {k, 1, n}]; Array[a, 20] (* Amiram Eldar, Mar 12 2021 *)
  • PARI
    a(n) = sum(k=1, n, gcd(k, n)^(n-1));
    
  • PARI
    a(n) = sumdiv(n, d, eulerphi(n/d)*d^(n-1));
    
  • PARI
    a(n) = sumdiv(n, d, moebius(n/d)*d*sigma(d, n-2));

Formula

a(n) = Sum_{d|n} phi(n/d) * d^(n-1).
a(n) = Sum_{d|n} mu(n/d) * d * sigma_(n-2)(d).
a(n) ~ n^(n-1). - Vaclav Kotesovec, May 23 2021