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 A014315 #17 Dec 16 2019 10:22:21 %S A014315 1,2,132,10132883443872 %N A014315 Number of permutations of squarefree monomials of degree n in n non-commutative variables that are compatible with a non-commutative monomial order (in the Groebner basis sense). %H A014315 Sage, <a href="http://doc.sagemath.org/html/en/reference/polynomial_rings/sage/rings/polynomial/term_order.html">Multivariate Polynomials and Polynomial Rings: Term orders</a>. %H A014315 Fritz Schwarz, <a href="https://doi.org/10.1145/122525.122526">Monomial orderings and Gröbner bases</a>, ACM SIGSAM Bulletin 25(1) (1991), 10-23. [It contains the algorithm MACOT that possibly can be used to enumerate all compatible monomial orders as described in the name of the sequence. - _Petros Hadjicostas_, Dec 16 2019] %H A014315 Wikipedia, <a href="https://en.wikipedia.org/wiki/Gr%C3%B6bner_basis">Gröbner basis</a>. %H A014315 Wikipedia, <a href="https://en.wikipedia.org/wiki/Monomial_order">Monomial order</a>. %e A014315 For example, when n=3, 132 of the (3!)! = 720 possible permutations of xyz, xzy, yxz, yzx, zxy, zyx are compatible with a monomial order. %K A014315 nonn,more %O A014315 1,2 %A A014315 Svante Linusson (linusson(AT)matematik.su.se)