|
%I #14 Mar 19 2022 03:25:37
%S 0,1,3,28,325,4976,92869,2038842,51397801,1461081781,46192638386,
%T 1606531631321,60921659773609,2500525907856718,110403919405245712,
%U 5216038547426332891,262495788417549517393,14015335940464667636300,791161963786588958170705
%N Total number of words beginning with the first letter of an n-ary alphabet in all sets of nonempty words with a total of n letters.
%H Alois P. Heinz, <a href="/A292845/b292845.txt">Table of n, a(n) for n = 0..382</a>
%e For n=2 and alphabet {a,b} we have 5 sets: {aa}, {ab}, {ba}, {bb}, {a,b}. There is a total of 3 words beginning with the first alphabet letter, thus a(2) = 3.
%p h:= proc(n, i, k) option remember; `if`(n=0, [1, 0], `if`(i<1, 0, add(
%p (p-> p+[0, p[1]*j])(binomial(k^i, j)*h(n-i*j, i-1, k)), j=0..n/i)))
%p end:
%p a= n-> `if`(n=0, 0, h(n$3)[2]/n):
%p seq(a(n), n=0..22);
%t h[n_, i_, k_] := h[n, i, k] = If[n == 0, {1, 0}, If[i < 1, {0, 0}, Sum[ Function[p, p + {0, p[[1]]*j}][Binomial[k^i, j]*h[n - i*j, i - 1, k]], {j, 0, n/i}]]];
%t a[n_] := If[n == 0, 0, h[n, n, n][[2]]/n];
%t Table[a[n], {n, 0, 22}] (* _Jean-François Alcover_, Mar 19 2022, after _Alois P. Heinz_ *)
%Y Cf. A216158, A292804, A292805, A292873.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Sep 24 2017
|
