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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A246924 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 square (1,2). 1
3, 0, 3, 2, 3, 2, 3, 4, 2, 3, 2, 1, 2, 3, 4, 3, 1, 2, 1, 4, 3, 2, 3, 4, 2, 3, 2, 3, 2, 3, 4, 3, 3, 2, 3, 2, 3, 4, 3, 4, 4, 3, 4, 3, 4, 3, 4, 5, 3, 4, 3, 4, 3, 4, 5, 4, 4, 5, 4, 5, 4, 5, 4, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
CROSSREFS
Sequence in context: A338498 A221166 A004604 * A274715 A324180 A271860
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 April 14 20:39 EDT 2024. Contains 371667 sequences. (Running on oeis4.)