Number A(n,k) of n-length words w over a k-ary alphabet {a_1,...,a_k} such that w contains never more than j consecutive letters a_j (for 1<=j<=k); square array A(n,k), n>=0, k>=0, read by antidiagonals.

A242464

Number A(n,k) of n-length words w over a k-ary alphabet {a_1,...,a_k} such that w contains never more than j consecutive letters a_j (for 1<=j<=k); square array A(n,k), n>=0, k>=0, read by antidiagonals.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =2a(8) =0a(9) =0a(10) =1a(11) =3a(12) =3a(13) =0a(14) =0a(15) =1a(16) =4a(17) =8a(18) =4a(19) =0a(20) =0a(21) =1a(22) =5a(23) =15a(24) =21a(25) =5a(26) =0a(27) =0a(28) =1a(29) =6

External references