|
Search: id:A008285
|
|
|
| A008285 |
|
Triangle T(n,k) = number of labeled order relations on n nodes in which longest chain has k nodes (n >= 1, 1 <= k <= n). |
|
+0
5
|
|
| 1, 1, 2, 1, 12, 6, 1, 86, 108, 24, 1, 840, 2310, 960, 120, 1, 11642, 65700, 42960, 9000, 720, 1, 227892, 2583126, 2510760, 712320, 90720, 5040, 1, 6285806, 142259628, 199424904, 71243760, 11481120, 987840, 40320
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 60.
|
|
EXAMPLE
|
1; 1,2; 1,12,6; 1,86,108,24; ...
|
|
CROSSREFS
|
Cf. A055531, A055532, A000142, A055533.
Sequence in context: A167128 A048743 A049055 this_sequence A119274 A066991 A132875
Adjacent sequences: A008282 A008283 A008284 this_sequence A008286 A008287 A008288
|
|
KEYWORD
|
nonn,tabl,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
