|
Search: id:A047070
|
|
|
| A047070 |
|
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=2x unless x=0 or x=h. |
|
+0
1
|
|
| 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 1, 1, 2, 2, 5, 4, 1, 1, 3, 4, 7, 9, 5, 1, 1, 4, 3, 7, 16, 14, 6, 1, 1, 5, 7, 7, 23, 30, 20, 7, 1, 1, 6, 12, 14, 30, 53, 50, 27, 8, 1, 1, 7, 18, 12, 30, 83, 103, 77, 35, 9, 1, 1, 8, 25, 30, 30, 113, 186, 180, 112, 44
(list; table; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
EXAMPLE
|
Diagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,2,2,1}; {1,1,2,3,1}; ...
|
|
CROSSREFS
|
Sequence in context: A006513 A105224 A143488 this_sequence A071127 A029381 A027926
Adjacent sequences: A047067 A047068 A047069 this_sequence A047071 A047072 A047073
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
