The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A253424. LINKS R. H. Hardin, Table of n, a(n) for n = 1..21 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 Adjacent sequences: A253413 A253414 A253415 * A253417 A253418 A253419 KEYWORD nonn AUTHOR R. H. Hardin, Dec 31 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 21 05:17 EST 2024. Contains 370219 sequences. (Running on oeis4.)