login
A253334
Number of (n+2)X(n+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.
0
69, 2028, 100512, 7184212, 900035309, 198343663311, 98349771149487, 65382647775609882, 75717898362438396460
OFFSET
1,1
COMMENTS
Diagonal of A253342.
EXAMPLE
Some solutions for n=3
..0..1..1..2..1....0..3..2..2..1....0..1..0..0..1....0..2..2..1..1
..2..3..1..1..1....2..3..1..2..2....1..1..0..0..0....2..2..0..2..2
..1..0..2..2..1....2..1..3..2..2....0..0..1..1..0....1..1..2..2..1
..2..1..2..1..1....2..2..2..1..2....1..0..0..0..1....2..1..2..1..2
..1..1..1..1..2....1..2..1..2..3....0..0..0..1..1....1..1..2..1..2
Knight distance matrix for n=3
..0..3..2..3..2
..3..4..1..2..3
..2..1..4..3..2
..3..2..3..2..3
..2..3..2..3..4
CROSSREFS
Sequence in context: A200826 A359105 A133708 * A017785 A017732 A252998
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 30 2014
STATUS
approved