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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089051 Number of ways of writing n as a sum of exactly 6 powers of 2. 4
0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 3, 4, 3, 4, 4, 5, 4, 6, 4, 5, 4, 6, 4, 6, 4, 5, 3, 5, 3, 6, 5, 6, 4, 7, 5, 7, 5, 8, 5, 7, 4, 7, 4, 6, 4, 8, 5, 7, 4, 7, 4, 7, 4, 7, 4, 5, 1, 5, 3, 5, 3, 7, 5, 6, 4, 9, 6, 8, 5, 9, 5, 7, 4, 8, 5, 8, 5, 10, 6, 8, 4, 9, 5, 8, 4, 8, 4, 5, 1, 7, 4, 6, 4, 9, 5, 7, 4, 9 (list; graph; refs; listen; history; internal format)
OFFSET

0,10

COMMENTS

The powers do not need to be distinct.

CROSSREFS

A column of A089052. Cf. A036987, A075897, A089048, A089049, A089050, A089053.

Sequence in context: A069923 A095840 A131343 * A108229 A023966 A088141

Adjacent sequences:  A089048 A089049 A089050 * A089052 A089053 A089054

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Dec 03 2003

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 18 00:14 EST 2012. Contains 206085 sequences.