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 A293798 #4 Oct 16 2017 11:32:15 %S A293798 1,4,17,58,193,603,1852,5539,16391,47919,139258,402365,1159175, %T A293798 3330974,9561080,27421882,78642072,225566206,647308614,1858741431, %U A293798 5341591906,15363474607,44228744168,127444421304,367573522408,1061131077602,3066124030310,8867379519154 %N A293798 Number of multisets of nonempty words with a total of n letters over ternary alphabet containing the third 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 A293798 Alois P. Heinz, <a href="/A293798/b293798.txt">Table of n, a(n) for n = 3..1000</a> %F A293798 a(n) = A293733(n) - A293732(n). %Y A293798 Column k=3 of A293109. %Y A293798 Cf. A293732, A293733. %K A293798 nonn %O A293798 3,2 %A A293798 _Alois P. Heinz_, Oct 16 2017