A047060 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=5x/3 unless x=0 or x=h.

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 1, 3, 2, 5, 4, 1, 1, 4, 3, 7, 9, 5, 1, 1, 5, 7, 7, 16, 14, 6, 1, 1, 6, 12, 14, 23, 30, 20, 7, 1, 1, 7, 18, 12, 23, 53, 50, 27, 8, 1, 1, 8, 25, 30, 23, 76, 103, 77, 35, 9, 1, 1, 9, 33, 55, 30, 99, 179, 180, 112

Offset

0,9

Links

Table of n, a(n) for n=0..74.

Sean A. Irvine, Java program (github)

Example

Diagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,1,2,1}; ...

Crossrefs

Sequence in context: A092334 A269971 A276605 * A050167 A047050 A205028

Adjacent sequences: A047057 A047058 A047059 * A047061 A047062 A047063

Keyword

nonn,tabl

Author

Clark Kimberling

Extensions

Data corrected by Sean A. Irvine, May 11 2021

Status

approved