T(n,k) = M0(n+1,k,f(n,k)), where M0(p,q,r) is the number of upright paths from (0,0) to (1,0) to (p,p-q) that meet the line y = x-r and do not rise above it and f(n,k) is the least t such that M0(n+1,k,f) is not 0.

A050176

T(n,k) = M0(n+1,k,f(n,k)), where M0(p,q,r) is the number of upright paths from (0,0) to (1,0) to (p,p-q) that meet the line y = x-r and do not rise above it and f(n,k) is the least t such that M0(n+1,k,f) is not 0.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =2a(8) =2a(9) =1a(10) =1a(11) =3a(12) =2a(13) =3a(14) =1a(15) =1a(16) =4a(17) =5a(18) =5a(19) =4a(20) =1a(21) =1a(22) =5a(23) =9a(24) =5a(25) =9a(26) =5a(27) =1a(28) =1a(29) =6

External references