A320219 Number of multisets of nonempty words with a total of n letters over nonary alphabet such that all letters occur at least once in the multiset.
4596553, 267009498, 8759066967, 214009517289, 4341556649997, 77402791217151, 1254856577798877, 18917548771779954, 269340155175667401, 3662449762145471938, 47963634774469915293, 608844238997012412552, 7528868495379885600462, 91056717786483891773442
Offset: 9
Keywords
Links
- Alois P. Heinz, Table of n, a(n) for n = 9..1000
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))(9): seq(a(n), n=9..25);