login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A253416
Number of (n+2)X(n+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.
1
17, 131, 9985, 316686, 9787192, 118474944, 10608304158, 137343065266, 10377510294334, 104208752940208, 17201597741284536, 188513786701536807, 26630716056607954131, 232536991177649068440, 62398022471626643456428
OFFSET
1,1
COMMENTS
Diagonal of A253424.
LINKS
EXAMPLE
Some solutions for n=2
..0..3..1..4....0..3..1..4....0..3..2..4....0..2..2..4....0..3..2..4
..2..3..1..2....2..3..1..2....2..3..1..2....3..3..1..1....2..3..1..2
..2..1..3..2....2..1..3..2....2..1..3..2....1..1..3..2....2..1..3..2
..4..2..2..2....4..2..2..1....4..1..3..1....4..2..2..1....4..2..2..2
Knight distance matrix for n=2
..0..3..2..5
..3..4..1..2
..2..1..4..3
..5..2..3..2
CROSSREFS
Sequence in context: A158959 A355052 A259418 * A275483 A125354 A126512
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 31 2014
STATUS
approved