|
%I #7 Dec 27 2014 18:20:37
%S 53,920,64228,3950239,343085240,40022802662,13003501426084,
%T 2924899495974755,1116335029837922477,284500068986134613257,
%U 261185251605484202491966
%N Number of (n+2)X(n+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 2, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.
%C Diagonal of A253119.
%e Some solutions for n=3:
%e ..0..1..1..2..2....0..2..2..2..2....0..2..2..3..2....0..2..1..1..0
%e ..2..3..1..1..2....3..3..1..1..2....2..3..1..1..3....1..2..0..1..2
%e ..1..1..2..2..1....2..1..3..3..2....1..1..3..2..2....1..1..2..1..1
%e ..2..1..2..1..1....2..2..2..2..2....2..1..2..2..2....1..1..2..1..2
%e ..1..2..1..1..3....2..3..2..2..3....1..2..2..2..3....2..2..1..1..2
%e Knight distance matrix for n=3:
%e ..0..3..2..3..2
%e ..3..4..1..2..3
%e ..2..1..4..3..2
%e ..3..2..3..2..3
%e ..2..3..2..3..4
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 27 2014
| 