login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A362628
a(n) = Sum_{d|n, phi(d)|n} d.
0
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,2
MATHEMATICA
a[n_] := DivisorSum[n, # &, Divisible[n, EulerPhi[#]] &]; Array[a, 100]
PROG
(PARI) a(n) = sumdiv(n, d, if (!(n % eulerphi(d)), d)); \\ Michel Marcus, Apr 28 2023
CROSSREFS
Cf. A000010 (phi), A069932, A362470.
Sequence in context: A050521 A266724 A247146 * A225561 A098093 A160627
KEYWORD
nonn,easy
AUTHOR
Wesley Ivan Hurt, Apr 28 2023
STATUS
approved