cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A263861 Triangle read by rows: T(n,k) (n>=0, k>=n+1) is the number of posets with n elements and whose order polytope has k facets.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 1, 7, 6, 2, 1, 13, 26, 17, 4, 2, 1, 22, 85, 112, 60, 27, 7, 3, 1
Offset: 0

Views

Author

Christian Stump, Oct 28 2015

Keywords

Comments

Row sums give A000112.
The order polytope of a poset P is given by all points in the unit cube [0,1]^P such that xp

Examples

			Triangle begins:
1,
1,
1,1,
1,3,1,
1,7,6,2,
1,13,26,17,4,2,
1,22,85,112,60,27,7,3,1,
...
		

Crossrefs

Cf. A000112.