Array T read by diagonals; T(i,j) is the number of paths from (0,0) to (i,j) consisting of nonvertical segments (x(k),y(k))-to-(x(k+1),y(k+1)) such that 0 = x(1) < x(2) < ... < x(n-1) < x(n)=i, 0 = y(1) <= y(2) <= ... <= y(n-1) <= y(n)=j, for i >= 0, j >= 0.

A049600

Array T read by diagonals; T(i,j) is the number of paths from (0,0) to (i,j) consisting of nonvertical segments (x(k),y(k))-to-(x(k+1),y(k+1)) such that 0 = x(1) < x(2) < ... < x(n-1) < x(n)=i, 0 = y(1) <= y(2) <= ... <= y(n-1) <= y(n)=j, for i >= 0, j >= 0.

Terms

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

External references