|
%I #7 Sep 27 2015 12:20:34
%S 319172,7426426,237047904,6203113283,143441370184,3788905574401,
%T 98349771149487,1926953342923239,46982876350047054,912616386638325080,
%U 16956678061495627361,235791177168459306126,4988065327432414551378
%N Number of (n+2)X(7+2) nonnegative integer arrays with all values the knight distance from the upper left minus as much as 3, with successive minimum path knight move differences either 0 or +1, and any unreachable value zero.
%C Column 7 of A253342.
%H R. H. Hardin, <a href="/A253341/b253341.txt">Table of n, a(n) for n = 1..63</a>
%e Some solutions for n=1
%e ..0..1..0..1..1..1..2..2..2....0..1..1..0..0..1..1..2..1
%e ..0..2..0..1..1..2..2..2..3....1..1..0..1..1..1..1..1..2
%e ..1..0..1..1..1..2..2..3..2....0..0..1..1..0..1..1..2..1
%e Knight distance matrix for n=1
%e ..0..3..2..3..2..3..4..5..4
%e ..3..4..1..2..3..4..3..4..5
%e ..2..1..4..3..2..3..4..5..4
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 30 2014
| 