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.

A160619 a(n) = Sum_{d|n} phi(n/d)*2^(d+1), with a(0) = 0.

This page as a plain text file.
%I A160619 #10 Jun 14 2022 15:51:31
%S A160619 0,4,12,24,48,80,168,280,576,1080,2160,4136,8448,16432,33096,65760,
%T A160619 131712,262208,525672,1048648,2099520,4194960,8392824,16777304,
%U A160619 33564096,67109200,134234256,268437672,536904480,1073741936,2147554080,4294967416,8590066944
%N A160619 a(n) = Sum_{d|n} phi(n/d)*2^(d+1), with a(0) = 0.
%H A160619 G. C. Greubel, <a href="/A160619/b160619.txt">Table of n, a(n) for n = 0..1000</a>
%F A160619 a(n) = 4*A034738(n). - _Michel Marcus_, May 07 2018
%t A160619 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 *)
%o A160619 (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
%Y A160619 Cf. A034738, A053635, A161219.
%K A160619 nonn
%O A160619 0,2
%A A160619 _N. J. A. Sloane_, Nov 21 2009
%E A160619 Name edited by _Michel Marcus_, Jun 14 2022