|
Search: id:A094021
|
|
|
| A094021 |
|
Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k components (1<=k<=n). |
|
+0
1
|
|
| 1, 1, 1, 3, 3, 1, 12, 14, 6, 1, 55, 75, 40, 10, 1, 273, 429, 275, 90, 15, 1, 1428, 2548, 1911, 770, 175, 21, 1, 7752, 15504, 13328, 6370, 1820, 308, 28, 1, 43263, 95931, 93024, 51408, 17640, 3822, 504, 36, 1, 246675, 600875, 648945, 406980, 162792, 42840
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Column k=1 yields A001764; column k=2 yields A026004.
|
|
REFERENCES
|
P. Flajolet and M. Noy, Analytic combinatorics of noncrossing configurations, Discrete Math. 204 (1999), 203-229.
|
|
FORMULA
|
T(n, k)=binomial(n, k-1)*binomial(3n-2k-1, n-k)/(2n-k). G.f. G=G(t, z) satisfies G^3+(t^3*z^2-t^2*z-3)G^2+(t^2*z+3)G-1=0.
|
|
EXAMPLE
|
T(3,2)=3 because, with A,B,C denoting the vertices of a triangle, we have the 2-component forests (A,BC), (B,CA) and (C,AB).
|
|
MAPLE
|
T:=proc(n, k) if k<=n then binomial(n, k-1)*binomial(3*n-2*k-1, n-k)/(2*n-k) else 0 fi end: seq(seq(T(n, k), k=1..n), n=1..11);
|
|
CROSSREFS
|
Cf. A001764, A026004.
Sequence in context: A050609 A120870 A010029 this_sequence A062746 A115193 A039797
Adjacent sequences: A094018 A094019 A094020 this_sequence A094022 A094023 A094024
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), May 31 2004
|
|
|
Search completed in 0.002 seconds
|
