A351111 Number of paths for a Racetrack car (using Moore neighborhood) with initial velocity zero, going from one corner to the diagonally opposite corner on an n X n grid, such that all positions are visited exactly once.
1, 0, 6, 2, 9436
Offset: 1
Examples
For n = 4 the following path and its reflection in the diagonal are the only solutions, so a(4) = 2. _ _ | | |_ |_ \ | _| |_|
Links
- Wikipedia, Racetrack