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!)
A151689 a(n) = sum_{k >= 1} 2^wt(k) * binomial(wt(n+k),k). 2

%I #2 Mar 30 2012 16:51:05

%S 2,6,4,6,16,16,6,6,16,16,18,40,50,30,8,6,16,16,18,40,50,30,20,40,50,

%T 54,100,142,112,48,10,6,16,16,18,40,50,30,20,40,50,54,100,142,112,48,

%U 22,40,50,54,100,142,112,72,102,142,160,256,386,368,210,70,12,6,16,16,18,40,50

%N a(n) = sum_{k >= 1} 2^wt(k) * binomial(wt(n+k),k).

%p wt := proc(n) local w,m,i;

%p w := 0; m := n; while m > 0 do i := m mod 2; w := w+i; m := (m-i)/2; od; w; end:

%p f := n->add( 2^k*binomial(wt(n+k),k),k=1..20 );

%Y Cf. A151685, A151690.

%K nonn

%O 0,1

%A _N. J. A. Sloane_, Jun 04 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 April 25 10:22 EDT 2024. Contains 371967 sequences. (Running on oeis4.)