id:A089049 - OEIS Search Results

Search: id:A089049

Displaying 1-1 of 1 results found.

page 1

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

+0
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; listen)

	OFFSET	`0,8`
	COMMENT	`The powers do not need to be distinct.`
	CROSSREFS	`A column of A089052. Cf. A036987, A075897, A089048, A089050, A089051, A089053.` `Sequence in context: A160242 A023568 A081753 this_sequence A029420 A029405 A029350` `Adjacent sequences: A089046 A089047 A089048 this_sequence A089050 A089051 A089052`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Dec 03 2003`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research