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.

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

Original entry on oeis.org

1, 5, 29, 262, 3129, 46705, 823549, 16777544, 387421251, 10000003469, 285311670621, 8916100581446, 302875106592265, 11112006826387025, 437893890391180013, 18446744073743123788, 827240261886336764193, 39346408075299116257065
Offset: 1

Views

Author

Seiichi Manyama, Mar 13 2021

Keywords

Crossrefs

Programs

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

Formula

If p is prime, a(p) = p-1 + p^p = A231712(p).