A253111 - OEIS

A253111

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.

53, 920, 64228, 3950239, 343085240, 40022802662, 13003501426084, 2924899495974755, 1116335029837922477, 284500068986134613257, 261185251605484202491966

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

Diagonal of A253119.

LINKS

Table of n, a(n) for n=1..11.

EXAMPLE

Some solutions for n=3:

..0..1..1..2..2....0..2..2..2..2....0..2..2..3..2....0..2..1..1..0

..2..3..1..1..2....3..3..1..1..2....2..3..1..1..3....1..2..0..1..2

..1..1..2..2..1....2..1..3..3..2....1..1..3..2..2....1..1..2..1..1

..2..1..2..1..1....2..2..2..2..2....2..1..2..2..2....1..1..2..1..2

..1..2..1..1..3....2..3..2..2..3....1..2..2..2..3....2..2..1..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: A077794 A200532 A289818 * A157618 A093982 A091548

Adjacent sequences: A253108 A253109 A253110 * A253112 A253113 A253114

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 27 2014

STATUS

approved