A047060 - OEIS

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.

%I #8 May 11 2021 21:31:20

%S 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,

%T 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,

%U 76,103,77,35,9,1,1,9,33,55,30,99,179,180,112

%N 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.

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a047/A047060.java">Java program</a> (github)

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

%K nonn,tabl

%O 0,9

%A _Clark Kimberling_

%E Data corrected by _Sean A. Irvine_, May 11 2021