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 A213871 #4 Jun 24 2012 12:58:53 %S A213871 1,362880,34459425,1035588754375,256653852463806955, %T A213871 224909472938181653263446,468682891926540940991787213006, %U A213871 1850042480471503379038420801262526759,11963401430840044468894095677711389363239184,114752550881830601773639529476205016572641397025904 %N A213871 Number of words w where each letter of the 9-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 A213871 a(0) = 1: the empty word. %e A213871 a(1) = 362880: all permutations of 9 letters. %Y A213871 Column k=9 of A213275. %K A213871 nonn %O A213871 0,2 %A A213871 _Alois P. Heinz_, Jun 23 2012