|
Search: id:A053440
|
|
|
| A053440 |
|
Number of k-simplices in the first derived complex of the standard triangulation of an n-simplex. Equivalently, T(n, k) is the number of ascending chains of length k+1 of non-empty subsets of the set {1, 2, ..., n+1}. |
|
+0
2
|
|
| 1, 3, 2, 7, 12, 6, 15, 50, 60, 24, 31, 180, 390, 360, 120, 63, 602, 2100, 3360, 2520, 720, 127, 1932, 10206, 25200, 31920, 20160, 5040, 255, 6050, 46620, 166824, 317520, 332640, 181440, 40320, 511, 18660, 204630, 1020600, 2739240, 4233600, 3780000
(list; table; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
T(0, k) = delta(0, k), T(n, k) = delta(0, k) + (k+1)(T(n-1, k-1) + (k+2)T(n-1, k)).
E.g.f.: exp(x)*(exp(x)-1)/(1-y*(exp(x)-1)). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 13 2003
|
|
CROSSREFS
|
Cf. A028246.
Cf. A002050, A019538.
Sequence in context: A018891 A034423 A099329 this_sequence A114647 A052546 A049968
Adjacent sequences: A053437 A053438 A053439 this_sequence A053441 A053442 A053443
|
|
KEYWORD
|
nonn,easy,tabl,nice
|
|
AUTHOR
|
Rob Arthan (rda(AT)lemma-one.com), Jan 12 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 14 2000
|
|
|
Search completed in 0.002 seconds
|
