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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

1, 3, 11, 68, 629, 7791, 117655, 2097224, 43046745, 1000000637, 25937424611, 743008378618, 23298085122493, 793714773371811, 29192926025391919, 1152921504608944272, 48661191875666868497, 2185911559738739594277, 104127350297911241532859
Offset: 1

Views

Author

Seiichi Manyama, Mar 12 2021

Keywords

Crossrefs

Programs

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

Formula

a(n) = Sum_{d|n} phi(n/d) * d^(d-1).
Showing 1-1 of 1 results.