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

0,9

COMMENTS

The powers do not need to be distinct.

CROSSREFS

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

Sequence in context: A057525 A139325 A068211 * A167439 A125173 A054725

Adjacent sequences:  A089047 A089048 A089049 * A089051 A089052 A089053

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 16 07:10 EST 2012. Contains 205874 sequences.