|
| |
|
|
A047110
|
|
Array read 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 up-step crosses the line y=2x/3. (Thus a path crosses the line only at lattice points and on right-steps.).
|
|
14
| |
|
|
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, 19, 10, 14, 6, 1, 1, 7, 20, 33, 29, 24, 20, 7, 1, 1, 8, 27, 53, 62, 29, 44, 27, 8, 1, 1, 9, 35, 80, 115, 91, 73, 71, 35, 9, 1, 1, 10, 44, 115, 195, 206, 164
(list; table; graph; refs; listen; history; internal format)
|
| |
| |
|
|
