login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 22 15:22 EDT 2024. Contains 374513 sequences. (Running on oeis4.)