T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.

A253424

T(n,k)=Number of (n+2)X(k+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 1, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.

Terms

    a(0) =17a(1) =56a(2) =56a(3) =257a(4) =131a(5) =257a(6) =642a(7) =1087a(8) =1087a(9) =642a(10) =1581a(11) =2827a(12) =9985a(13) =2827a(14) =1581a(15) =2389a(16) =10411a(17) =44729a(18) =44729a(19) =10411a(20) =2389a(21) =5716a(22) =15803a(23) =215037a(24) =316686a(25) =215037a(26) =15803a(27) =5716a(28) =7691a(29) =41139

External references