Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having largest ascent k, n>=0, 0<=k<=n.

A238129

Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having largest ascent k, n>=0, 0<=k<=n.

Terms

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

External references