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.

A362628 a(n) = Sum_{d|n, phi(d)|n} d.

Original entry on oeis.org

1, 3, 1, 7, 1, 12, 1, 15, 1, 3, 1, 28, 1, 3, 1, 31, 1, 39, 1, 22, 1, 3, 1, 60, 1, 3, 1, 7, 1, 12, 1, 63, 1, 3, 1, 91, 1, 3, 1, 50, 1, 33, 1, 7, 1, 3, 1, 124, 1, 3, 1, 7, 1, 120, 1, 15, 1, 3, 1, 43, 1, 3, 1, 127, 1, 12, 1, 7, 1, 3, 1, 195, 1, 3, 1, 7, 1, 12, 1, 106, 1, 3, 1, 140
Offset: 1

Views

Author

Wesley Ivan Hurt, Apr 28 2023

Keywords

Crossrefs

Cf. A000010 (phi), A069932, A362470.

Programs

  • Mathematica
    a[n_] := DivisorSum[n, # &, Divisible[n, EulerPhi[#]] &]; Array[a, 100]
  • PARI
    a(n) = sumdiv(n, d, if (!(n % eulerphi(d)), d)); \\ Michel Marcus, Apr 28 2023