A319498 - cp's OEIS frontend

A319498 Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that for k>0 the k-th letter occurs at least once and within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

%I A319498 #22 Feb 09 2021 10:59:44
%S A319498 1,0,1,0,1,2,0,2,5,6,0,2,16,18,24,0,3,39,80,84,120,0,4,106,323,432,
%T A319498 480,720,0,5,245,1106,2052,2820,3240,5040,0,6,621,3822,10576,14820,
%U A319498 21480,25200,40320,0,8,1431,13840,41896,86724,124440,186480,221760,362880
%N A319498 Number T(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that for k>0 the k-th letter occurs at least once and within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
%C A319498 T(n,k) is defined for n,k >= 0.  The triangle contains only the terms with k <= n.  T(n,k) = 0 for k > n.
%H A319498 Alois P. Heinz, <a href="/A319498/b319498.txt">Rows n = 0..140, flattened</a>
%F A319498 T(n,k) = A292795(n,k) - A292795(n,k-1) for k > 0, T(n,0) = A000007(n).
%e A319498 T(3,1) = 2: {aaa}, {aa,a}.
%e A319498 T(3,2) = 5: {aab}, {aba}, {baa}, {ab,a}, {ba,a}.
%e A319498 T(3,3) = 6: {abc}, {acb}, {bac}, {bca}, {cab}, {cba}.
%e A319498 Triangle T(n,k) begins:
%e A319498   1;
%e A319498   0, 1;
%e A319498   0, 1,    2;
%e A319498   0, 2,    5,     6;
%e A319498   0, 2,   16,    18,    24;
%e A319498   0, 3,   39,    80,    84,   120;
%e A319498   0, 4,  106,   323,   432,   480,    720;
%e A319498   0, 5,  245,  1106,  2052,  2820,   3240,   5040;
%e A319498   0, 6,  621,  3822, 10576, 14820,  21480,  25200,  40320;
%e A319498   ...
%p A319498 b:= proc(n, i, t) option remember; `if`(t=1, 1/n!,
%p A319498       add(b(n-j, j, t-1)/j!, j=i..n/t))
%p A319498     end:
%p A319498 g:= (n, k)-> `if`(k=0, `if`(n=0, 1, 0), n!*b(n, 0, k)):
%p A319498 h:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,
%p A319498       add(h(n-i*j, i-1, k)*binomial(g(i, k), j), j=0..n/i)))
%p A319498     end:
%p A319498 T:= (n, k)-> h(n$2, k) -`if`(k=0, 0, h(n$2, k-1)):
%p A319498 seq(seq(T(n, k), k=0..n), n=0..12);
%t A319498 b[n_, i_, t_] := b[n, i, t] = If[t == 1, 1/n!,
%t A319498      Sum[b[n - j, j, t - 1]/j!, {j, i, n/t}]];
%t A319498 g[n_, k_] := If[k == 0, If[n == 0, 1, 0], n!*b[n, 0, k]];
%t A319498 h[n_, i_, k_] := h[n, i, k] = If[n == 0, 1, If[i < 1, 0,
%t A319498      Sum[h[n - i*j, i - 1, k]*Binomial[g[i, k], j], {j, 0, n/i}]]];
%t A319498 T[n_, k_] := h[n, n, k] - If[k == 0, 0, h[n, n, k - 1]];
%t A319498 Table[Table[T[n, k], {k, 0, n}], {n, 0, 12}] // Flatten (* _Jean-François Alcover_, Feb 09 2021, after _Alois P. Heinz_ *)
%Y A319498 Columns k=0-1 give: A000007, A000009 (for n>0).
%Y A319498 Row sums give A292796.
%Y A319498 Main diagonal gives A000142.
%Y A319498 First lower diagonal gives A038720 (for n>1).
%Y A319498 Cf. A292795, A319495.
%K A319498 nonn,tabl
%O A319498 0,6
%A A319498 _Alois P. Heinz_, Sep 20 2018

cp's OEIS Frontend