cp's OEIS Frontend

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.

%I A320216 #4 Oct 07 2018 14:45:46
%S A320216 4051,114402,1918083,24917060,277491084,2788377264,26047147641,
%T A320216 230519395506,1957678084920,16097696173138,129006208397535,
%U A320216 1012503732847524,7811457988379140,59410698772806630,446452429135687776,3320813986603421328,24485059125388934799
%N 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.
%H A320216 Alois P. Heinz, <a href="/A320216/b320216.txt">Table of n, a(n) for n = 6..1000</a>
%p A320216 b:= proc(n, k) option remember; `if`(n=0, 1, add(add(
%p A320216       d*k^d, d=numtheory[divisors](j))*b(n-j, k), j=1..n)/n)
%p A320216     end:
%p A320216 a:= n-> (k-> add(b(n, k-i)*(-1)^i*binomial(k, i), i=0..k))(6):
%p A320216 seq(a(n), n=6..25);
%Y A320216 Column k=6 of A257740.
%Y A320216 Cf. A320207.
%K A320216 nonn
%O A320216 6,1
%A A320216 _Alois P. Heinz_, Oct 07 2018