id:A089053 - OEIS Search Results

Search: id:A089053

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of partitions of n into exactly k powers of 2.

+0
6

1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 0, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 0, 1, 1, 1, 2, 2, 1, 1, 1, 0, 1, 2, 2, 2, 2, 2, 1, 1, 1, 0, 0, 1, 2, 2, 2, 2, 2, 1, 1, 1, 0, 1, 2, 2, 3, 3, 2, 2, 2, 1, 1, 1, 0, 0, 1, 2, 2, 3, 3, 2, 2, 2, 1, 1, 1, 0, 0, 1, 3, 3, 3, 4, 3, 2, 2, 2, 1, 1, 1 (list; table; graph; listen)

	OFFSET	`0,18`
	CROSSREFS	`See A089052, which is the main entry for this triangle.` `Sequence in context: A005091 A086831 A111405 this_sequence A068462 A054973 A030351` `Adjacent sequences: A089050 A089051 A089052 this_sequence A089054 A089055 A089056`
	KEYWORD	`nonn,tabl`
	AUTHOR	`njas, Dec 03 2003`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research