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).

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

Offset

1,1

Links

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

Crossrefs

Cf. A018837, A246925, A065775.

Sequence in context: A338498 A221166 A004604 * A274715 A324180 A271860

Adjacent sequences: A246921 A246922 A246923 * A246925 A246926 A246927

Keyword

nonn,easy,full,tabf,fini

Author

Frieder Mittmann, Sep 07 2014

Status

approved