Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A151681
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A151681 a(n) = sum_{k >= 0, k even} binomial(wt(n+k),k+1), where wt() = A000120(). +0
1
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; listen)
OFFSET

0,2

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: A048896 A130831 A151678 this_sequence A131097 A062790 A046640

Adjacent sequences: A151678 A151679 A151680 this_sequence A151682 A151683 A151684

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 01 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research