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 A293748 #5 Oct 15 2017 17:08:32
%S A293748 1,1,2,6,15,45,136,430,1415,4845,17234,63497,242720,958754,3916799,
%T A293748 16493831,71586602,319336319,1463096806,6869041635,33014439494,
%U A293748 162130576595,812715417240,4151894763819,21595739171153,114222733829429,613789962584588,3347502798880170
%N A293748 Number of sets of nonempty words with a total of n letters over nonary 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 A293748 Alois P. Heinz, <a href="/A293748/b293748.txt">Table of n, a(n) for n = 0..1000</a>
%F A293748 G.f.: Product_{j>=1} (1+x^j)^A212915(j).
%Y A293748 Column k=9 of A293112.
%Y A293748 Cf. A212915, A293739.
%K A293748 nonn
%O A293748 0,3
%A A293748 _Alois P. Heinz_, Oct 15 2017