|
| |
|
|
A047030
|
|
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=x/4 unless x=0 or x=h.
|
|
8
| |
|
|
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 1, 4, 6, 4, 2, 1, 1, 5, 10, 10, 4, 1, 1, 1, 6, 15, 20, 14, 4, 2, 1, 1, 7, 21, 35, 34, 18, 4, 3, 1, 1, 8, 28, 56, 69, 52, 22, 4, 4, 1, 1, 9, 36, 84, 125, 121, 74, 26, 8, 5, 1, 1, 10, 45, 120, 209, 246, 195, 100
(list; table; graph; refs; listen; history; internal format)
|
| |
| |
|
|
