No comments yet!| susam.net
OFFSET| oeis.org
Write 0, 1, 2, ... in a clockwise spiral; sequence gives numbers on one of 4 diagonals.| oeis.org
The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may only make moves which simultaneously shift one square along one axis and two along the other). It is therefore a (1,2)-leaper graph, as well as the Euclidean distance-sqrt(5) graph. n×n knight graphs abstracted from the chessboard are illustrated above for n=3, ..., 6. The 1×1 knight graph is the...| mathworld.wolfram.com
Your task is to count for k=1,2,\ldots,n the number of ways two knights can be placed on a k \times k chessboard so that they do not attack each other.| cses.fi
Susam's Puzzle Pages| susam.net
Susam's Mathematics Pages| susam.net