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 A293804 #4 Oct 16 2017 12:05:15 %S A293804 1,10,101,762,5644,37759,249346,1575028,9882928,60748286,372625221, %T A293804 2265134302,13781508870,83609540368,508633993673,3095996847792, %U A293804 18917973769416,115888594051965,713122785565957,4404107814340191,27330754066244314,170323622877898732 %N A293804 Number of multisets of nonempty words with a total of n letters over nonary alphabet containing the ninth 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 A293804 Alois P. Heinz, <a href="/A293804/b293804.txt">Table of n, a(n) for n = 9..1000</a> %F A293804 a(n) = A293739(n) - A293738(n). %Y A293804 Column k=9 of A293109. %Y A293804 Cf. A293738, A293739. %K A293804 nonn %O A293804 9,2 %A A293804 _Alois P. Heinz_, Oct 16 2017