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 A213872 #4 Jun 25 2012 14:19:33 %S A213872 1,3628800,654729075,89575852312675,140633739174235040170, %T A213872 961415357313559098150122721,18131599140232990157442722880124741, %U A213872 725168149513389307543056971716033431701831,51960277212541922189750307005207837858451630919380 %N A213872 Number of words w where each letter of the 10-ary alphabet occurs n times and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. %e A213872 a(0) = 1: the empty word. %e A213872 a(1) = 3628800: all permutations of 10 letters. %Y A213872 Column k=10 of A213275. %K A213872 nonn %O A213872 0,2 %A A213872 _Alois P. Heinz_, Jun 23 2012