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!)
A246925 8 X 8 square array read by rows: T(i,j) = number of moves of a knight to reach the square (i,j) when starting from the corner square (1,1). 1
0, 3, 2, 3, 2, 3, 4, 5, 3, 4, 1, 2, 3, 4, 3, 4, 2, 1, 4, 3, 2, 3, 4, 5, 3, 2, 3, 2, 3, 4, 3, 4, 2, 3, 2, 3, 4, 3, 4, 5, 3, 4, 3, 4, 3, 4, 5, 4, 4, 3, 4, 3, 4, 5, 4, 5, 5, 4, 5, 4, 5, 4, 5, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The initial position needs no moves to be reached and is set to value 0

Read by rows:

a(1) a(2) .... a(8)

a(9) a(10) .... a(16)

....

....

a(57) a(58) .... a(64)

LINKS

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

CROSSREFS

Cf. A018837, A246924. See A065775 for the analog on an infinite board.

Sequence in context: A264843 A316290 A029211 * A217618 A018837 A097618

Adjacent sequences: A246922 A246923 A246924 * A246926 A246927 A246928

KEYWORD

nonn,easy,full,tabf,fini

AUTHOR

Frieder Mittmann, Sep 07 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 3 05:56 EST 2022. Contains 358512 sequences. (Running on oeis4.)