login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151678 a(n) = sum_{k >= 0} binomial(wt(n+k),2*k), where wt() = A000120(). 0
1, 1, 2, 1, 2, 2, 4, 1, 2, 2, 4, 2, 4, 5, 7, 1, 2, 2, 4, 2, 4, 5, 7, 2, 4, 5, 7, 5, 8, 12, 11, 1, 2, 2, 4, 2, 4, 5, 7, 2, 4, 5, 7, 5, 8, 12, 11, 2, 4, 5, 7, 5, 8, 12, 11, 5, 8, 12, 12, 12, 17, 26, 16, 1, 2, 2, 4, 2, 4, 5, 7, 2, 4, 5, 7, 5, 8, 12, 11, 2, 4, 5, 7, 5, 8, 12, 11, 5, 8, 12, 12, 12, 17, 26, 16 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

CROSSREFS

Sequence in context: A060177 A048896 A130831 * A151681 A131097 A062790

Adjacent sequences:  A151675 A151676 A151677 * A151679 A151680 A151681

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.