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!)
A185251 a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,k). 3

%I #17 May 09 2018 10:17:57

%S 0,0,2,3,16,25,96,154,512,837,2560,4246,12288,20618,57344,97140,

%T 262144,447661,1179648,2028478,5242880,9070110,23068672,40122028,

%U 100663296,175913250,436207616,765561564,1879048192,3310623412,8053063680,14238676712,34359738368

%N a(n) = Sum_{k=0..floor(n/2)} k*binomial(n,k).

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

%p seq(n*2^(n-2) - `if`(type(n,even), 0, binomial(n-1, (n-1)/2)*n/2) ,n=0..32); # _Mark van Hoeij_, May 12 2013

%t Table[Sum[k Binomial[n, k], {k, 0, Floor[n/2]}], {n, 0, 40}] (* _Harvey P. Dale_, Nov 25 2012 *)

%o (PARI) a(n)=sum(k=0,n\2,k*binomial(n,k))

%K nonn,easy

%O 0,3

%A _M. F. Hasler_, Jan 24 2012

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 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)