login
Triangle read by rows: T(n,k) (n>=0, k>=1) is the number of posets with n elements and k maximal chains.
1

%I #8 Oct 31 2015 14:39:13

%S 1,1,1,1,1,3,1,1,7,6,2,1,13,25,18,4,2

%N Triangle read by rows: T(n,k) (n>=0, k>=1) is the number of posets with n elements and k maximal chains.

%C Row sums give A000112.

%H FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000071">The number of maximal chains in a poset</a>.

%e Triangle begins:

%e 1,

%e 1,

%e 1,1,

%e 1,3,1,

%e 1,7,6,2,

%e 1,13,25,18,4,2,

%e ...

%Y Cf. A000112.

%K nonn,tabf,more

%O 0,6

%A _Christian Stump_, Oct 28 2015