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.

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

Original entry on oeis.org

1, 2, 10, 84, 1301, 15693, 376762, 6168552, 176787631, 3770427352, 142364319626, 3152758480715, 154718778284149, 4340093860950619, 210971170836848270, 7281694486114555088, 435659030617933827137, 14181121059071691716406, 1052864393300587929716722, 41673907052879908244100770
Offset: 1

Views

Author

Ilya Gutkovskiy, Feb 18 2020

Keywords

Crossrefs

Programs

  • Magma
    [&+[(k div Gcd(n,k))^n:k in [1..n]]:n in [1..20]]; // Marius A. Burtea, Feb 18 2020
  • Mathematica
    Table[Sum[(k/GCD[n, k])^n, {k, 1, n}], {n, 1, 20}]
    Table[Sum[Sum[If[GCD[k, d] == 1, k^n, 0], {k, 1, d}], {d, Divisors[n]}], {n, 1, 20}]

Formula

a(n) = Sum_{k=1..n} (lcm(n, k)/n)^n.
a(n) = Sum_{d|n} Sum_{k=1..d, gcd(k, d) = 1} k^n.