A183043 Triangular array, T(i,j)=number of knight's moves to points on vertical segments (n,0), (n,1),...,(n,n) on infinite chessboard.
0, 3, 2, 2, 1, 4, 3, 2, 3, 2, 2, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 6, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 7, 6, 6, 5, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 6, 7, 6, 7, 6, 7, 6, 7, 8, 7, 8, 6, 7, 6, 7, 6, 7, 6, 7, 8, 7, 8, 9, 8
Offset: 0
Examples
Triangle starts: 0, 3,2, 2,1,4, 3,2,3,2, 2,3,2,3,4, 3,4,3,4,3,4, 4,3,4,3,4,5,4, 5,4,5,4,5,4,5,6, 4,5,4,5,4,5,6,5,6, 5,6,5,6,5,6,5,6,7,6 ... See examples under A242511.
References
- Fred Lunnon, Knights in Daze, to appear.
Links
- Alois P. Heinz, Rows n = 0..140, flattened
- Fred Lunnon, Revised tables & functions for knight's path distance and count (MAGMA code)
Crossrefs
Programs
-
Magma
// See link for recursive & explicit algorithms. - Fred Lunnon, May 18 2014
Formula
See A065775.
Extensions
Edited by N. J. A. Sloane, May 23 2014
Offset corrected by Alois P. Heinz, Sep 10 2014
Comments