A263858 Triangle read by rows: T(n,k) (n>=0, k>=1) is the number of posets with n elements and k maximal chains.
1, 1, 1, 1, 1, 3, 1, 1, 7, 6, 2, 1, 13, 25, 18, 4, 2
Offset: 0
Examples
Triangle begins: 1, 1, 1,1, 1,3,1, 1,7,6,2, 1,13,25,18,4,2, ...
Links
- FindStat - Combinatorial Statistic Finder, The number of maximal chains in a poset.
Crossrefs
Cf. A000112.
Comments