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 A293800 #4 Oct 16 2017 11:41:35 %S A293800 1,6,37,178,852,3767,16576,70635,300433,1260163,5287178,22058377, %T A293800 92181691,384663989,1609206870,6737170404,28291573975,119043337521, %U A293800 502559706310,2127305239457,9035671605064,38494638887783,164564824326835,705742561369640,3036895648331815 %N A293800 Number of multisets of nonempty words with a total of n letters over quinary alphabet containing the fifth 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 A293800 Alois P. Heinz, <a href="/A293800/b293800.txt">Table of n, a(n) for n = 5..1000</a> %F A293800 a(n) = A293735(n) - A293734(n). %Y A293800 Column k=5 of A293109. %Y A293800 Cf. A293734, A293735. %K A293800 nonn %O A293800 5,2 %A A293800 _Alois P. Heinz_, Oct 16 2017