cp's OEIS Frontend

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.

A292724 Number of multisets of nonempty words with a total of n letters over 9-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

This page as a plain text file.
%I A292724 #5 Sep 22 2017 11:11:39
%S A292724 1,1,4,14,67,343,2151,14900,119259,1055520,6837054,49975756,358031350,
%T A292724 2673108092,20399335633,161247005007,1321885836686,10814140769210,
%U A292724 93349395210404,726371063425227,5939975798740967,48195816632614079,396235068140514442
%N A292724 Number of multisets of nonempty words with a total of n letters over 9-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
%H A292724 Alois P. Heinz, <a href="/A292724/b292724.txt">Table of n, a(n) for n = 0..1000</a>
%F A292724 G.f.: Product_{j>=1} 1/(1-x^j)^A226879(j).
%F A292724 Euler transform of A226879.
%p A292724 b:= proc(n, i, t) option remember; `if`(t=1, 1/n!,
%p A292724       add(b(n-j, j, t-1)/j!, j=i..n/t))
%p A292724     end:
%p A292724 a:= proc(n) option remember; `if`(n=0, 1, add(add(d*d!*
%p A292724       b(d, 0, 9), d=numtheory[divisors](j))*a(n-j), j=1..n)/n)
%p A292724     end:
%p A292724 seq(a(n), n=0..35);
%Y A292724 Column k=9 of A292712.
%Y A292724 Cf. A226879, A226873.
%K A292724 nonn
%O A292724 0,3
%A A292724 _Alois P. Heinz_, Sep 21 2017