cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Frieder Mittmann

Frieder Mittmann's wiki page.

Frieder Mittmann has authored 2 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).

Original entry on oeis.org

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

Views

Author

Frieder Mittmann, Sep 07 2014

Keywords

Crossrefs

Cf. A018837, A246925, A065775.

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

Original entry on oeis.org

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

Views

Author

Frieder Mittmann, Sep 07 2014

Keywords

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.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.