This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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). 4
 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; refs; listen; history; text; internal format)
 OFFSET 1,3 REFERENCES L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 60. LINKS EXAMPLE Triangle begins:   1;   1,2;   1,12,6;   1,86,108,24;   ... CROSSREFS Cf. A055531, A055532, A000142, A055533, A001035 (row sums). Sequence in context: A049055 A276998 A222866 * A119274 A066991 A132875 Adjacent sequences:  A008282 A008283 A008284 * A008286 A008287 A008288 KEYWORD nonn,tabl,nice AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 21 13:45 EST 2018. Contains 317449 sequences. (Running on oeis4.)