|
| |
|
|
A047050
|
|
Array T 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 step touches the line y=4x/3 unless x=0 or x=h.
|
|
10
| |
|
|
1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 3, 2, 5, 4, 1, 1, 4, 5, 5, 9, 5, 1, 1, 5, 9, 10, 14, 14, 6, 1, 1, 6, 14, 9, 14, 28, 20, 7, 1, 1, 7, 20, 23, 14, 42, 48, 27, 8, 1, 1, 8, 27, 43, 23, 56, 90, 75, 35, 9, 1, 1, 9, 35, 70, 66, 56, 146, 165, 110, 44
(list; table; graph; refs; listen; history; internal format)
|
| |
| |
|
|
