Triangle read by rows: T(n,k) (0<=k<=n) is the number of Schroeder paths of length 2n, having k (1,0)-steps on the lines y=0 and y=1 (a Schroeder path of length 2n is a path from (0,0) to (2n,0), consisting of steps U=(1,1), D=(1,-1) and H=(2,0) and never going below the x-axis).
A110189
Triangle read by rows: T(n,k) (0<=k<=n) is the number of Schroeder paths of length 2n, having k (1,0)-steps on the lines y=0 and y=1 (a Schroeder path of length 2n is a path from (0,0) to (2n,0), consisting of steps U=(1,1), D=(1,-1) and H=(2,0) and never going below the x-axis).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =1a(6) =6a(7) =9a(8) =6a(9) =1a(10) =22a(11) =32a(12) =25a(13) =10a(14) =1a(15) =90a(16) =128a(17) =105a(18) =55a(19) =15a(20) =1a(21) =394a(22) =552a(23) =462a(24) =271a(25) =105a(26) =21a(27) =1a(28) =1806a(29) =2504
External references
- oeis: A110189