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!)
A053634 a(n) = Sum_{ d divides n } phi(d)*2^(n/d)/(2n). 6

%I #20 Dec 26 2017 23:32:53

%S 2,3,4,7,10,18,30,54,94,176,316,591,1096,2058,3856,7301,13798,26244,

%T 49940,95373,182362,349626,671092,1290714,2485534,4793790,9256396,

%U 17896284,34636834,67109898,130150588,252647064,490853416,954440950

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

%C Offset is 3 because a(2) is 3/2, not an integer. - _Michel Marcus_, Sep 11 2013

%H G. C. Greubel, <a href="/A053634/b053634.txt">Table of n, a(n) for n = 3..3000</a>

%H James East, Ron Niles, <a href="https://arxiv.org/abs/1710.11245">Integer polygons of given perimeter</a>, arXiv:1710.11245 [math.CO], 2017.

%F a(n) = A000031(n)/2.

%t a[n_] := DivisorSum[n, EulerPhi[#]*2^(n/#)&]/(2n); Table[a[n], {n, 3, 36}] (* _Jean-François Alcover_, Dec 07 2015 *)

%o (PARI) a(n) = sumdiv (n, d, eulerphi(d)*2^(n/d)/(2*n)); \\ _Michel Marcus_, Sep 11 2013

%Y Cf. A000016, A000031, A053635, A063776.

%K nonn

%O 3,1

%A _N. J. A. Sloane_, Mar 23 2000

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 25 11:24 EDT 2024. Contains 371967 sequences. (Running on oeis4.)