Number A(n,k) of k-ascent sequences of length n with no consecutive repeated letters; square array A(n,k), n>=0, k>=0, read by antidiagonals.

A264909

Number A(n,k) of k-ascent sequences of length n with no consecutive repeated letters; 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) =0a(6) =1a(7) =1a(8) =1a(9) =0a(10) =1a(11) =1a(12) =2a(13) =2a(14) =0a(15) =1a(16) =1a(17) =3a(18) =6a(19) =5a(20) =0a(21) =1a(22) =1a(23) =4a(24) =12a(25) =21a(26) =16a(27) =0a(28) =1a(29) =1

External references