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 A293888 #4 Oct 18 2017 19:09:23 %S A293888 1,8,64,394,2390,13297,73408,391136,2079440,10889818,57092581, %T A293888 297655901,1556501986,8132631687,42662224461,224171916523, %U A293888 1183189769473,6263511343367,33311244068612,177803544643092,953453596829798,5132942333604244,27758886429083153 %N A293888 Number of sets of nonempty words with a total of n letters over septenary alphabet containing the seventh letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter. %H A293888 Alois P. Heinz, <a href="/A293888/b293888.txt">Table of n, a(n) for n = 7..1000</a> %F A293888 a(n) = A293746(n) - A293745(n). %Y A293888 Column k=7 of A293113. %Y A293888 Cf. A293745, A293746. %K A293888 nonn %O A293888 7,2 %A A293888 _Alois P. Heinz_, Oct 18 2017