id:A091889 - OEIS Search Results

Search: id:A091889

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into sums of exactly two distinct powers of 2.

+0
5

0, 0, 1, 0, 1, 2, 0, 1, 3, 2, 2, 5, 2, 3, 8, 4, 6, 12, 6, 11, 16, 11, 16, 24, 17, 23, 34, 26, 35, 50, 35, 50, 67, 55, 72, 93, 76, 99, 126, 112, 135, 171, 150, 186, 229, 210, 249, 304, 280, 336, 398, 380, 443, 526, 499, 584, 680, 665, 759, 886, 858, 985, 1136, 1123 (list; graph; listen)

	OFFSET	`1,6`
	EXAMPLE	`a(9)=3: 9 = (2^3+2^0) = (2^2+2^1)+(2^1+2^0) =` `(2^1+2^0)+(2^1+2^0)+(2^1+2^0).`
	CROSSREFS	`Cf. A018819, A091890, A000120, A000041, A091893, A091891.` `Sequence in context: A079219 A124377 A022827 this_sequence A067591 A097609 A077884` `Adjacent sequences: A091886 A091887 A091888 this_sequence A091890 A091891 A091892`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 10 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research