This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089049 Number of ways of writing n as a sum of exactly 4 powers of 2. 5
 0, 0, 0, 0, 1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 3, 1, 2, 1, 2, 2, 3, 2, 3, 1, 2, 2, 3, 1, 3, 1, 1, 0, 2, 1, 2, 2, 3, 2, 3, 1, 3, 2, 3, 1, 3, 1, 1, 0, 2, 2, 3, 1, 3, 1, 1, 0, 3, 1, 1, 0, 1, 0, 0, 0, 2, 1, 2, 2, 3, 2, 3, 1, 3, 2, 3, 1, 3, 1, 1, 0, 3, 2, 3, 1, 3, 1, 1, 0, 3, 1, 1, 0, 1, 0, 0, 0, 2, 2, 3, 1, 3, 1, 1, 0, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 COMMENTS The powers do not need to be distinct. LINKS Alois P. Heinz, Table of n, a(n) for n = 0..20000 CROSSREFS A column of A089052. Cf. A036987, A075897, A089048, A089050, A089051, A089053. Sequence in context: A232551 A261129 A305871 * A275235 A029420 A194822 Adjacent sequences:  A089046 A089047 A089048 * A089050 A089051 A089052 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.

Last modified October 20 21:31 EDT 2018. Contains 316404 sequences. (Running on oeis4.)