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. 5
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; text; internal format)
OFFSET

0,10

COMMENTS

The powers do not need to be distinct.

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..65536

CROSSREFS

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

Sequence in context: A069923 A095840 A131343 * A317359 A108229 A023966

Adjacent sequences:  A089048 A089049 A089050 * A089052 A089053 A089054

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Dec 03 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 26 13:05 EDT 2019. Contains 323586 sequences. (Running on oeis4.)