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 A213868 #4 Jun 24 2012 12:58:19 %S A213868 1,1,1859,48349015,5795673908453,1953740543358042205, %T A213868 1409438188685787895321841,1835364055105945091130559202709, %U A213868 3847028733161627562733350467148495403,11963401430840044468894095677711389363239184,51960277212541922189750307005207837858451630919380 %N A213868 Number of words w where each letter of the n-ary alphabet occurs 8 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 A213868 a(0) = 1: the empty word. %e A213868 a(1) = 1: aaaaaaaa. %e A213868 a(2) = 1859: aaaaaaaabbbbbbbb, aaaaaaababbbbbbb, ..., baabababababaabb, baababababababab. %Y A213868 Row n=8 of A213275. %K A213868 nonn %O A213868 0,3 %A A213868 _Alois P. Heinz_, Jun 23 2012