login
A125778
Array T by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no right-step crosses the line y=3x/2. (Thus a path crosses the line only at lattice points and on up-steps.).
1
1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 3, 1, 1, 4, 5, 5, 4, 1, 1, 5, 9, 10, 9, 5, 1, 1, 6, 14, 10, 19, 14, 6, 1, 1, 7, 20, 24, 29, 33, 20, 7, 1, 1, 8, 27, 44, 29, 62, 53, 27, 8, 1, 1, 9, 35, 71, 73, 91, 115, 80, 35, 9, 1, 1, 10, 44, 106, 144, 164, 206, 195, 115, 44, 10, 1, 1, 11, 54, 150
OFFSET
0,8
COMMENTS
T = transpose of A047110.
EXAMPLE
Northwest corner:
1 1 1 1 1 1
1 1 2 3 4 5
1 2 2 5 9 14
1 3 5 10 10 24
1 4 9 19 29 29
CROSSREFS
Cf. A047110.
Sequence in context: A075532 A050176 A047130 * A047110 A288533 A093869
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Dec 08 2006
STATUS
approved