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 A293739 #9 Dec 19 2020 03:23:01
%S A293739 1,1,3,7,20,54,164,500,1630,5472,19256,70121,265723,1041184,4225484,
%T A293739 17689505,76392933,339283021,1548592471,7246210567,34725853445,
%U A293739 170096822940,850715642495,4337263437693,22519434992230,118916581795167,638088881489144,3475474084479428
%N A293739 Number of multisets 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.
%C A293739 This sequence differs from A293110 first at n=10.
%H A293739 Alois P. Heinz, <a href="/A293739/b293739.txt">Table of n, a(n) for n = 0..1000</a>
%F A293739 G.f.: Product_{j>=1} 1/(1-x^j)^A212915(j).
%F A293739 a(n) ~ c * 9^n / n^18, where c = 978644175524508179.918397627321774... - _Vaclav Kotesovec_, Dec 19 2020
%Y A293739 Column k=9 of A293108.
%Y A293739 Cf. A212915, A293110, A293748.
%K A293739 nonn
%O A293739 0,3
%A A293739 _Alois P. Heinz_, Oct 15 2017