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 A293970 #6 Oct 20 2017 18:53:11 %S A293970 10,206,1926,13957,85610,476631,2477550,12289388,58942808,276126959, %T A293970 1272626168,5803545269,26305047510,118947441994,538263144030, %U A293970 2444159610896,11163194878438,51392032544011,238939873029462,1123916805738119,5357138152220234,25913264903132961 %N A293970 Number of sets of exactly eight nonempty words with a total of n letters over n-ary 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 A293970 Alois P. Heinz, <a href="/A293970/b293970.txt">Table of n, a(n) for n = 21..816</a> %F A293970 a(n) = [x^n y^8] Product_{j>=1} (1+y*x^j)^A000085(j). %p A293970 g:= proc(n) option remember; `if`(n<2, 1, g(n-1)+(n-1)*g(n-2)) end: %p A293970 b:= proc(n, i) option remember; series(`if`(n=0, 1, `if`(i<1, 0, %p A293970 add(b(n-i*j, i-1)*binomial(g(i), j)*x^j, j=0..n/i))), x, 9) %p A293970 end: %p A293970 a:= n-> coeff(b(n$2), x, 8): %p A293970 seq(a(n), n=21..45); %Y A293970 Column k=8 of A293815. %Y A293970 Cf. A000085. %K A293970 nonn %O A293970 21,1 %A A293970 _Alois P. Heinz_, Oct 20 2017