id:A091890 - OEIS Search Results

Search: id:A091890

Displaying 1-1 of 1 results found.

page 1

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

+0
5

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 2, 0, 0, 0, 1, 1, 1, 3, 2, 0, 1, 3, 3, 2, 5, 2, 1, 1, 5, 6, 3, 9, 5, 4, 5, 10, 9, 8, 13, 8, 10, 8, 16, 17, 15, 22, 18, 18, 20, 25, 28, 27, 34, 31, 32, 33, 44, 49, 44, 64, 53, 56, 61, 71, 77, 77, 100, 88, 94, 99, 123, 125, 132, 162, 147, 154 (list; graph; listen)

	OFFSET	`1,14`
	EXAMPLE	`a(14)=2: 14 = (2^3+2^2+2^1) = (2^2+2^1+2^0)+(2^2+2^1+2^0).`
	CROSSREFS	`Cf. A018819, A091889, A000120, A000041, A091893, A091891.` `Sequence in context: A147693 A070936 A014081 this_sequence A029431 A091492 A025086` `Adjacent sequences: A091887 A091888 A091889 this_sequence A091891 A091892 A091893`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 10 2004`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research