login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A293112 Number A(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; square array A(n,k), n>=0, k>=0, read by antidiagonals. 13

%I #24 Sep 20 2018 12:13:24

%S 1,1,0,1,1,0,1,1,1,0,1,1,2,2,0,1,1,2,5,2,0,1,1,2,6,10,3,0,1,1,2,6,14,

%T 23,4,0,1,1,2,6,15,39,51,5,0,1,1,2,6,15,44,104,111,6,0,1,1,2,6,15,45,

%U 129,284,243,8,0,1,1,2,6,15,45,135,386,775,530,10,0

%N Number A(n,k) of sets of nonempty words with a total of n letters over k-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter; square array A(n,k), n>=0, k>=0, read by antidiagonals.

%H Alois P. Heinz, <a href="/A293112/b293112.txt">Antidiagonals n = 0..80, flattened</a>

%F G.f. of column k: Product_{j>=1} (1+x^j)^A182172(j,k).

%F A(n,k) = Sum_{j=0..k} A293113(n,j).

%e Square array A(n,k) begins:

%e 1, 1, 1, 1, 1, 1, 1, 1, ...

%e 0, 1, 1, 1, 1, 1, 1, 1, ...

%e 0, 1, 2, 2, 2, 2, 2, 2, ...

%e 0, 2, 5, 6, 6, 6, 6, 6, ...

%e 0, 2, 10, 14, 15, 15, 15, 15, ...

%e 0, 3, 23, 39, 44, 45, 45, 45, ...

%e 0, 4, 51, 104, 129, 135, 136, 136, ...

%e 0, 5, 111, 284, 386, 422, 429, 430, ...

%p h:= l-> (n-> add(i, i=l)!/mul(mul(1+l[i]-j+add(`if`(l[k]

%p <j, 0, 1), k=i+1..n), j=1..l[i]), i=1..n))(nops(l)):

%p g:= proc(n, i, l) option remember;

%p `if`(n=0, h(l), `if`(i<1, 0, `if`(i=1, h([l[], 1$n]),

%p g(n, i-1, l) +`if`(i>n, 0, g(n-i, i, [l[], i])))))

%p end:

%p b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,

%p add(b(n-i*j, i-1, k)*binomial(g(i, k, []), j), j=0..n/i)))

%p end:

%p A:= (n, k)-> b(n$2, k):

%p seq(seq(A(n, d-n), n=0..d), d=0..14);

%t h[l_] := Function[n, Total[l]!/Product[Product[1 + l[[i]] - j + Sum[If[ l[[k]]<j, 0, 1], {k, i+1, n}], {j, 1, l[[i]]}], {i, 1, n}]][Length[l]];

%t g[n_, i_, l_] := g[n, i, l] = If[n == 0, h[l], If[i < 1, 0, If[i == 1, h[Join[l, Table[1, n]]], g[n, i - 1, l] + If[i > n, 0, g[n - i, i, Append[l, i]]]]]];

%t b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 1, 0, Sum[b[n - i*j, i - 1, k]*Binomial[g[i, k, {}], j], {j, 0, n/i}]]];

%t A[n_, k_] := b[n, n, k];

%t Table[A[n, d-n], {d, 0, 14}, {n, 0, d}] // Flatten (* _Jean-François Alcover_, Jun 03 2018, from Maple *)

%Y Columns k=0-10 give: A000007, A000009, A293741, A293742, A293743, A293744, A293745, A293746, A293747, A293748, A293749.

%Y Main diagonal gives A293114.

%Y Cf. A182172, A293108, A293113.

%K nonn,tabl

%O 0,13

%A _Alois P. Heinz_, Sep 30 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)