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 A293749 #5 Oct 15 2017 17:23:10
%S A293749 1,1,2,6,15,45,136,430,1415,4845,17235,63508,242841,959746,3924747,
%T A293749 16551199,71994097,322098625,1481655067,6990945197,33812067833,
%U A293749 167294687170,846131720816,4367249636291,22985935628080,123193976095986,671862417595209,3724122166971836
%N A293749 Number of sets of nonempty words with a total of n letters over denary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
%H A293749 Alois P. Heinz, <a href="/A293749/b293749.txt">Table of n, a(n) for n = 0..1000</a>
%F A293749 G.f.: Product_{j>=1} (1+x^j)^A212916(j).
%Y A293749 Column k=10 of A293112.
%Y A293749 Cf. A212916, A293740.
%K A293749 nonn
%O A293749 0,3
%A A293749 _Alois P. Heinz_, Oct 15 2017