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

 

Logo


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

0,9

COMMENTS

The powers do not need to be distinct.

LINKS

Table of n, a(n) for n=0..104.

CROSSREFS

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

Sequence in context: A242166 A068211 A236832 * A167439 A272314 A241216

Adjacent sequences:  A089047 A089048 A089049 * A089051 A089052 A089053

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 24 01:22 EDT 2018. Contains 311819 sequences. (Running on oeis4.)