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
Offset: 10
Keywords
Links
- Alois P. Heinz, Table of n, a(n) for n = 10..975
Programs
-
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);