A263863 - OEIS

A263863

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

1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 3, 3, 2, 2, 0, 3, 0, 0, 0, 1, 1, 1, 3, 5, 8, 5, 7, 4, 8, 2, 5, 1, 5, 0, 3, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,7

COMMENTS

Row sums give A000112.

LINKS

FindStat - Combinatorial Statistic Finder, The number of chains of a poset.

EXAMPLE

Triangle begins:

1,1,

1,1,2,0,1,

1,1,3,3,2,2,0,3,0,0,0,1,

1,1,3,5,8,5,7,4,8,2,5,1,5,0,3,0,0,0,4,0,0,0,0,0,0,0,1,

...

CROSSREFS

KEYWORD

nonn,tabf

AUTHOR

STATUS

approved