|
Search: id:A072574
|
|
|
| A072574 |
|
Triangle T(n,k) of number of compositions (unordered partitions) of n into exactly k distinct parts, 1<=k<=n. |
|
+0
4
|
|
| 1, 1, 0, 1, 2, 0, 1, 2, 0, 0, 1, 4, 0, 0, 0, 1, 4, 6, 0, 0, 0, 1, 6, 6, 0, 0, 0, 0, 1, 6, 12, 0, 0, 0, 0, 0, 1, 8, 18, 0, 0, 0, 0, 0, 0, 1, 8, 24, 24, 0, 0, 0, 0, 0, 0, 1, 10, 30, 24, 0, 0, 0, 0, 0, 0, 0, 1, 10, 42, 48, 0, 0, 0, 0, 0, 0, 0, 0, 1, 12, 48, 72, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 12, 60, 120, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
If terms in the compositions did not need to be distinct then the triangle would have values C(n-1,k-1), essentially A007318 offset.
|
|
LINKS
|
Index entries for sequences related to compositions
|
|
FORMULA
|
T(n, k) =T(n-k, k)+k*T(n-k, k-1) [with T(n, 0)=1 if n=0 and 0 otherwise] =A000142(k)*A060016(n, k).
|
|
EXAMPLE
|
Rows start: 1; 1,0; 1,2,0; 1,2,0,0; 1,4,0,0,0; 1,4,6,0,0,0; 1,6,6,0,0,0,0; etc. T(6,2)=4 since 6 can be written as 1+5=2+4=4+2=5+1.
|
|
CROSSREFS
|
Columns (offset) include A057427 and A052928. Row sums are A032020. Cf. A060016, A072575, A072576.
Sequence in context: A101661 A079644 A072705 this_sequence A058650 A112177 A115723
Adjacent sequences: A072571 A072572 A072573 this_sequence A072575 A072576 A072577
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Jun 21 2002
|
|
|
Search completed in 0.002 seconds
|
