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!)
A151681 a(n) = sum_{k >= 0, k even} binomial(wt(n+k),k+1), where wt() = A000120(). 0
1, 2, 1, 2, 2, 4, 1, 2, 2, 4, 2, 5, 4, 7, 1, 2, 2, 4, 2, 5, 4, 7, 2, 5, 4, 8, 5, 12, 7, 11, 1, 2, 2, 4, 2, 5, 4, 7, 2, 5, 4, 8, 5, 12, 7, 11, 2, 5, 4, 8, 5, 12, 7, 12, 5, 12, 8, 17, 12, 26, 11, 16, 1, 2, 2, 4, 2, 5, 4, 7, 2, 5, 4, 8, 5, 12, 7, 11, 2, 5, 4, 8, 5, 12, 7, 12, 5, 12, 8, 17, 12, 26, 11, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
MAPLE
wt := proc(n) local w, m, i; w := 0; m := n; while m > 0 do i := m mod 2; w := w+i; m := (m-i)/2; od; w; end:
f:=proc(n) local t1, k; global wt; t1:=0; for k from 0 to 20 do if k mod 2 = 0 then t1:=t1+binomial(wt(n+k), k); fi; od; t1; end;
CROSSREFS
Sequence in context: A130831 A151678 A273126 * A336138 A366600 A365461
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jun 01 2009
STATUS
approved

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 16 04:38 EDT 2024. Contains 371696 sequences. (Running on oeis4.)