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 A293799 #4 Oct 16 2017 11:36:52 %S A293799 1,5,26,107,439,1663,6283,22912,83507,298936,1071564,3804461,13542785, %T A293799 47964338,170456957,604293910,2150604057,7647190962,27302834888, %U A293799 97491596984,349544018586,1254140950775,4517792721381,16291580640312,58974333255158,213744923737227 %N A293799 Number of multisets of nonempty words with a total of n letters over quaternary alphabet containing the fourth 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 A293799 Alois P. Heinz, <a href="/A293799/b293799.txt">Table of n, a(n) for n = 4..1000</a> %F A293799 a(n) = A293734(n) - A293733(n). %Y A293799 Column k=4 of A293109. %Y A293799 Cf. A293733, A293734. %K A293799 nonn %O A293799 4,2 %A A293799 _Alois P. Heinz_, Oct 16 2017