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!)
A160619 a(n) = Sum_{d|n} phi(n/d)*2^(d+1), with a(0) = 0. 2
0, 4, 12, 24, 48, 80, 168, 280, 576, 1080, 2160, 4136, 8448, 16432, 33096, 65760, 131712, 262208, 525672, 1048648, 2099520, 4194960, 8392824, 16777304, 33564096, 67109200, 134234256, 268437672, 536904480, 1073741936, 2147554080, 4294967416, 8590066944 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = 4*A034738(n). - Michel Marcus, May 07 2018
MATHEMATICA
a[n_]:= If[n<1, 0, Sum[EulerPhi[n/d] 2^(d+1), {d, Divisors[n]}]]; Table[a[n], {n, 0, 50}] (* G. C. Greubel, May 06 2018 *)
PROG
(PARI) a(n) = if (n==0, 0, sumdiv(n, d, eulerphi(n/d)*2^(d+1))); \\ Michel Marcus, May 07 2018; corrected Jun 14 2022
CROSSREFS
Sequence in context: A328225 A192797 A278355 * A352668 A330011 A132477
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 21 2009
EXTENSIONS
Name edited by Michel Marcus, Jun 14 2022
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 April 19 06:16 EDT 2024. Contains 371782 sequences. (Running on oeis4.)