|
|
A320216
|
|
Number of multisets of nonempty words with a total of n letters over senary alphabet such that all letters occur at least once in the multiset.
|
|
3
|
|
|
4051, 114402, 1918083, 24917060, 277491084, 2788377264, 26047147641, 230519395506, 1957678084920, 16097696173138, 129006208397535, 1012503732847524, 7811457988379140, 59410698772806630, 446452429135687776, 3320813986603421328, 24485059125388934799
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
6,1
|
|
LINKS
|
|
|
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))(6):
seq(a(n), n=6..25);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|