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.

A057792 Sum[k^k], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1.

Original entry on oeis.org

1, 1, 5, 28, 288, 3126, 50069, 826696, 17604145, 388244060, 10405071317, 285312497280, 9211817190184, 303160805686506, 11415167261421900, 438197051187369424, 18896062057839751444, 827240565046755853710
Offset: 1

Views

Author

Leroy Quet, Nov 04 2000

Keywords

Examples

			a(4) = 1^1 + 3^3 = 28, since 1 and 3 are the positive integers <= 4 and relatively prime to 4.
		

Crossrefs

Programs

  • PARI
    a(n) = sum(k=1, n, if (gcd(k, n)==1, k^k)); \\ Michel Marcus, Jun 19 2021