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 A213867 #4 Jun 24 2012 12:57:56 %S A213867 1,1,561,2914395,54862627919,2468722942369153,211109968702038259993, %T A213867 29745278219128813035415595,6273648300104128965616586081511, %U A213867 1850042480471503379038420801262526759,725168149513389307543056971716033431701831 %N A213867 Number of words w where each letter of the n-ary alphabet occurs 7 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 A213867 a(0) = 1: the empty word. %e A213867 a(1) = 1: aaaaaaa. %e A213867 a(2) = 561: aaaaaaabbbbbbb, aaaaaababbbbbb, ..., baababababaabb, baabababababab. %Y A213867 Row n=7 of A213275. %K A213867 nonn %O A213867 0,3 %A A213867 _Alois P. Heinz_, Jun 23 2012