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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 7 of A253342.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..63

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

Adjacent sequences: A253338 A253339 A253340 * A253342 A253343 A253344

KEYWORD

nonn

AUTHOR

R. H. Hardin, Dec 30 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 1 14:52 EST 2022. Contains 358468 sequences. (Running on oeis4.)