A320220 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A320220

Number of multisets of nonempty words with a total of n letters over denary alphabet such that all letters occur at least once in the multiset.

58941091, 4143348470, 162731313045, 4718107140980, 112729591991185, 2351902614090062, 44373396691290660, 774761803780874980, 12721776529833584465, 198768703664184994530, 2981185419002290273673, 43212794112241851734090, 608596903477972496493095

(list; graph; refs; listen; history; text; internal format)

OFFSET

10,1

LINKS

Alois P. Heinz, Table of n, a(n) for n = 10..975

MAPLE

b:= proc(n, k) option remember; `if`(n=0, 1, add(add(

d*k^d, d=numtheory[divisors](j))*b(n-j, k), j=1..n)/n)

end:

a:= n-> (k-> add(b(n, k-i)*(-1)^i*binomial(k, i), i=0..k))(10):

seq(a(n), n=10..25);

CROSSREFS