Number A(n,k) of words w where each letter of the k-ary alphabet occurs n times and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z; square array A(n,k), n>=0, k>=0, read by antidiagonals.
A213275
Number A(n,k) of words w where each letter of the k-ary alphabet occurs n times and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z; square array A(n,k), n>=0, k>=0, read by antidiagonals.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =2a(8) =1a(9) =1a(10) =1a(11) =6a(12) =3a(13) =1a(14) =1a(15) =1a(16) =24a(17) =15a(18) =7a(19) =1a(20) =1a(21) =1a(22) =120a(23) =105a(24) =106a(25) =19a(26) =1a(27) =1a(28) =1a(29) =720
External references
- oeis: A213275