|
Search: id:A047000
|
|
|
| A047000 |
|
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/2 unless x=0 or x=h. |
|
+0
10
|
|
| 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 1, 1, 1, 4, 5, 2, 2, 1, 1, 5, 9, 7, 4, 3, 1, 1, 6, 14, 16, 7, 3, 4, 1, 1, 7, 20, 30, 23, 7, 7, 5, 1, 1, 8, 27, 50, 53, 30, 14, 12, 6, 1, 1, 9, 35, 77, 103, 83, 30, 12, 18, 7, 1, 1, 10, 44, 112, 180, 186, 113, 30, 30
(list; table; graph; listen)
|
|
|
OFFSET
|
0,8
|
|
|
EXAMPLE
|
Diagonals (starting on row #0): {1}; {1,1}; {1,1,1}; {1,2,2,1}; {1,3,2,1,1}; ...
|
|
CROSSREFS
|
The sequence T(2n, n)/2 for n=1, 2, 3, ... is A006013.
Adjacent sequences: A046997 A046998 A046999 this_sequence A047001 A047002 A047003
Sequence in context: A120964 A059674 A117545 this_sequence A139767 A057555 A075532
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
