OFFSET
1,6
COMMENTS
Place a 1 in the upper left corner of the square. Let k be the number placed last. At each step place k+1 at a distance k vertically or horizontally from k. Solutions are counted up to mirroring in the backward diagonal. That is, all solutions have 2 to the right of 1. Obviously, n is the largest possible value since the next step will inevitably lead outside the square.
EXAMPLE
Sample solutions:
n=6 n=7 n=8
1 2 - - - - 1 2 - - - - - 1 2 - - - - 8 -
- - - - - - 7 5 - - - - 6 - - - - - - - -
- 3 - - - - - 3 - - - - - 5 3 - - 4 - - -
- - - - - - - - - - - - - - - - - - - - -
- - - - - - - - - - - - - - - - - - - - -
6 4 - - - 5 - 4 - - - - - - - - - - - - -
- - - - - - - - - - - - - - -
6 - - - - - 7 -
CROSSREFS
KEYWORD
nonn
AUTHOR
Lars Blomberg, Nov 04 2019
STATUS
approved
