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

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

Offset

1,2

Links

Table of n, a(n) for n=1..99.

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: A194317 A096810 A190436 * A195050 A127371 A036849

Adjacent sequences: A133693 A133694 A133695 * A133697 A133698 A133699

Keyword

nonn,tabl

Author

Reinhard Zumkeller, Dec 31 2007

Status

approved