A320218 Number of multisets of nonempty words with a total of n letters over octonary alphabet such that all letters occur at least once in the multiset.
394353, 18536744, 498516252, 10092149744, 171141602198, 2569517304288, 35303763087512, 453509029790240, 5527943088161719, 64619198312435832, 730123641203028584, 8021699561768649792, 86097120229812852336, 906057856878889742408, 9376575130404097999848
Offset: 8
Keywords
Links
- Alois P. Heinz, Table of n, a(n) for n = 8..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))(8): seq(a(n), n=8..25);