|
Search: id:A047071
|
|
|
| A047071 |
|
Array T by antidiagonals: 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=3x unless x=0 or x=h. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 3, 1, 1, 1, 3, 6, 4, 1, 1, 2, 3, 9, 10, 5, 1, 1, 3, 3, 12, 19, 15, 6, 1, 1, 4, 6, 15, 31, 34, 21, 7, 1, 1, 5, 4, 15, 46, 65, 55, 28, 8, 1, 1, 6, 9, 15, 61, 111, 120, 83, 36, 9, 1, 1, 7, 15, 15, 76, 172, 231, 203, 119, 45
(list; table; graph; listen)
|
|
|
OFFSET
|
0,9
|
|
|
EXAMPLE
|
Antidiagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,1,2,1}; {1,2,3,3,1}; ...
|
|
CROSSREFS
|
Adjacent sequences: A047068 A047069 A047070 this_sequence A047072 A047073 A047074
Sequence in context: A087917 A087741 A054991 this_sequence A124287 A060240 A128495
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
