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.

A369742 a(n) = Sum_{p|n, p prime} p^(mu(n/p)^2).

Original entry on oeis.org

0, 2, 3, 2, 5, 5, 7, 1, 3, 7, 11, 3, 13, 9, 8, 1, 17, 4, 19, 3, 10, 13, 23, 2, 5, 15, 1, 3, 29, 10, 31, 1, 14, 19, 12, 2, 37, 21, 16, 2, 41, 12, 43, 3, 4, 25, 47, 2, 7, 6, 20, 3, 53, 2, 16, 2, 22, 31, 59, 4, 61, 33, 4, 1, 18, 16, 67, 3, 26, 14, 71, 2, 73, 39, 6, 3, 18
Offset: 1

Views

Author

Wesley Ivan Hurt, Jan 30 2024

Keywords

Crossrefs

Cf. A008683 (mu), A143519.

Programs

  • Mathematica
    Table[DivisorSum[n, #^(MoebiusMu[n/#]^2) &, PrimeQ[#] &], {n, 100}]

Formula

a(p^k) = p for p prime and 1 <= k <= 2, else 1 if k >= 3. - Wesley Ivan Hurt, Jun 26 2024