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.
%I A263861 #11 Oct 31 2015 14:41:09 %S A263861 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 %N 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. %C A263861 Row sums give A000112. %C A263861 The order polytope of a poset P is given by all points in the unit cube [0,1]^P such that xp<xq for all p<q in P. %H A263861 FindStat - Combinatorial Statistic Finder, <a href="http://www.findstat.org/StatisticsDatabase/St000104">The number of facets in the order polytope of this poset</a>. %H A263861 Richard Stanley, <a href="http://dedekind.mit.edu/~rstan/pubs/pubfiles/66.pdf">Two poset polytopes</a>, Discrete & Computational Geometry 1 (1986), DOI: 10.1007/BF02187680. %e A263861 Triangle begins: %e A263861 1, %e A263861 1, %e A263861 1,1, %e A263861 1,3,1, %e A263861 1,7,6,2, %e A263861 1,13,26,17,4,2, %e A263861 1,22,85,112,60,27,7,3,1, %e A263861 ... %Y A263861 Cf. A000112. %K A263861 nonn,tabf,more %O A263861 0,6 %A A263861 _Christian Stump_, Oct 28 2015