|
|
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.
|
|
2
|
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
EXAMPLE
|
For n = 4 the following path and its reflection in the diagonal are the only solutions, so a(4) = 2.
_ _
| | |_
|_ \ |
_| |_|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|