id:A089051 - OEIS Search Results

Search: id:A089051

Displaying 1-1 of 1 results found.

page 1

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

+0
5

0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 3, 4, 3, 4, 4, 5, 4, 6, 4, 5, 4, 6, 4, 6, 4, 5, 3, 5, 3, 6, 5, 6, 4, 7, 5, 7, 5, 8, 5, 7, 4, 7, 4, 6, 4, 8, 5, 7, 4, 7, 4, 7, 4, 7, 4, 5, 1, 5, 3, 5, 3, 7, 5, 6, 4, 9, 6, 8, 5, 9, 5, 7, 4, 8, 5, 8, 5, 10, 6, 8, 4, 9, 5, 8, 4, 8, 4, 5, 1, 7, 4, 6, 4, 9, 5, 7, 4, 9 (list; graph; listen)

	OFFSET	`0,10`
	COMMENT	`The powers do not need to be distinct.`
	CROSSREFS	`A column of A089052. Cf. A036987, A075897, A089048, A089049, A089050, A089053.` `Sequence in context: A069923 A095840 A131343 this_sequence A108229 A023966 A088141` `Adjacent sequences: A089048 A089049 A089050 this_sequence A089052 A089053 A089054`
	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 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research