The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A160620 a(n) = Sum_{d|n} phi(n/d)^2*2^d. 2

%I #12 Jun 25 2021 01:52:11

%S 0,2,6,16,28,64,96,200,320,616,1152,2248,4304,8480,16728,33152,66048,

%T 131584,263160,524936,1050176,2098240,4196952,8389576,16782976,

%U 33555744,67117920,134220712,268453360,536872480,1073780352,2147485448,4295034880,8589944384

%N a(n) = Sum_{d|n} phi(n/d)^2*2^d.

%H G. C. Greubel, <a href="/A160620/b160620.txt">Table of n, a(n) for n = 0..1000</a>

%F Dirichlet (convolution) product of A127473 and A000079. - _R. J. Mathar_, Jun 24 2021

%p A160620 := proc(n)

%p if n =0 then

%p 0;

%p else

%p add((numtheory[phi](n/d))^2*2^d,d=numtheory[divisors](n)) ;

%p end if ;

%p end proc: # _R. J. Mathar_, Jun 24 2021

%t a[n_]:= If[n<1, 0, Sum[EulerPhi[n/d]^2 * 2^d, {d, Divisors[n]}]]; Table[a[n], {n,0,50}] (* _G. C. Greubel_, May 06 2018 *)

%o (PARI) a(n) = if (n, sumdiv(n, d, eulerphi(n/d)^2*2^d), 0); \\ _Michel Marcus_, May 07 2018, Jun 22 2021

%Y Cf. A053635.

%Y Cf. A000079, A127473.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Nov 21 2009

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 May 23 11:42 EDT 2024. Contains 372760 sequences. (Running on oeis4.)