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 A293803 #4 Oct 16 2017 11:58:19 %S A293803 1,9,82,563,3807,23376,142085,829038,4816390,27477989,156716051, %T A293803 887263747,5034299169,28513927121,162089445027,922536360293, %U A293803 5273968531519,30236181831043,174184141284927,1007162425272715,5852489042303046,34148843838375080,200241641820235902 %N A293803 Number of multisets of nonempty words with a total of n letters over octonary alphabet containing the eighth 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 A293803 Alois P. Heinz, <a href="/A293803/b293803.txt">Table of n, a(n) for n = 8..1000</a> %F A293803 a(n) = A293738(n) - A293737(n). %Y A293803 Column k=8 of A293109. %Y A293803 Cf. A293737, A293738. %K A293803 nonn %O A293803 8,2 %A A293803 _Alois P. Heinz_, Oct 16 2017