login
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
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)
CROSSREFS
Cf. A018837, A246924. See A065775 for the analog on an infinite board.
Sequence in context: A264843 A316290 A029211 * A217618 A018837 A097618
KEYWORD
nonn,easy,full,tabf,fini
AUTHOR
Frieder Mittmann, Sep 07 2014
STATUS
approved