Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A151689
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A151689 a(n) = sum_{k >= 1} 2^wt(k) * binomial(wt(n+k),k). +0
3
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, 54, 100, 142, 112, 48, 10, 6, 16, 16, 18, 40, 50, 30, 20, 40, 50, 54, 100, 142, 112, 48, 22, 40, 50, 54, 100, 142, 112, 72, 102, 142, 160, 256, 386, 368, 210, 70, 12, 6, 16, 16, 18, 40, 50 (list; graph; listen)
OFFSET

0,1

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 := n->add( 2^k*binomial(wt(n+k), k), k=1..20 );

CROSSREFS

Cf. A151685, A151690.

Adjacent sequences: A151686 A151687 A151688 this_sequence A151690 A151691 A151692

Sequence in context: A119250 A059773 A127399 this_sequence A088438 A097265 A074208

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 04 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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research