id:A133696 - OEIS Search Results

Search: id:A133696

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into parts k and n, 1<=k<=n.

+0
3

1, 2, 0, 2, 1, 0, 2, 2, 1, 0, 2, 2, 1, 1, 0, 2, 0, 0, 0, 1, 0, 2, 2, 2, 2, 1, 1, 0, 2, 4, 3, 0, 2, 1, 1, 0, 2, 3, 10, 4, 3, 5, 1, 1, 0, 2, 0, 5, 11, 0, 8, 2, 0, 1, 0, 2, 3, 6, 8, 9, 8, 5, 2, 1, 1, 0, 2, 6, 0, 0, 14, 78, 10, 0, 0, 1, 1, 0, 2, 4, 8, 14, 20, 23, 19, 13, 7, 3, 1, 1, 0, 2, 0, 9, 0, 29, 0, 0, 0 (list; table; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`Binomial(8,2)=28: T(8,2)=#{3x8+4,2x8+3x4,8+5x4,7x4}=4;` `Binomial(8,3)=56: T(8,3)=#{7x8,4x8+8x3,8+16x3}=3.`
	CROSSREFS	`Sequence in context: A035394 A067167 A096810 this_sequence A127371 A036849 A097364` `Adjacent sequences: A133693 A133694 A133695 this_sequence A133697 A133698 A133699`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 31 2007`

page 1

Search completed in 0.002 seconds

Last modified December 4 20:00 EST 2008. Contains 151309 sequences.

AT&T Labs Research