id:A089050 - OEIS Search Results

Search: id:A089050

Displaying 1-1 of 1 results found.

page 1

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

+0
5

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

	OFFSET	`0,9`
	COMMENT	`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 this_sequence A125173 A054725 A064415` `Adjacent sequences: A089047 A089048 A089049 this_sequence A089051 A089052 A089053`
	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 December 19 21:04 EST 2009. Contains 171054 sequences.

AT&T Labs Research