A089049 Number of ways of writing n as a sum of exactly 4 powers of 2.

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

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: A261129 A309121 A305871 * A275235 A029420 A194822

Adjacent sequences: A089046 A089047 A089048 * A089050 A089051 A089052

Keyword

nonn

Author

N. J. A. Sloane, Dec 03 2003

Status

approved