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”).

A253341
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.
1
319172, 7426426, 237047904, 6203113283, 143441370184, 3788905574401, 98349771149487, 1926953342923239, 46982876350047054, 912616386638325080, 16956678061495627361, 235791177168459306126, 4988065327432414551378
OFFSET
1,1
COMMENTS
Column 7 of A253342.
LINKS
EXAMPLE
Some solutions for n=1
..0..1..0..1..1..1..2..2..2....0..1..1..0..0..1..1..2..1
..0..2..0..1..1..2..2..2..3....1..1..0..1..1..1..1..1..2
..1..0..1..1..1..2..2..3..2....0..0..1..1..0..1..1..2..1
Knight distance matrix for n=1
..0..3..2..3..2..3..4..5..4
..3..4..1..2..3..4..3..4..5
..2..1..4..3..2..3..4..5..4
CROSSREFS
Sequence in context: A186623 A202468 A251528 * A210317 A205931 A236318
KEYWORD
nonn
AUTHOR
R. H. Hardin, Dec 30 2014
STATUS
approved