|
|
A363577
|
|
Number of inequivalent Hamiltonian paths starting in the lower left corner of an n X n grid graph (paths differing only by rotations and reflections are regarded as equivalent).
|
|
0
|
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
Equivalently, number of inequivalent Hamiltonian paths starting in a corner of an n X n grid graph (paths differing only by rotations and reflections are regarded as equivalent). - Martin Ehrenstein, Jul 08 2023
|
|
LINKS
|
|
|
EXAMPLE
|
There are 3 paths for n=3:
+--+--+ +--+--+ +--+ +
| | | | | | |
+ + + + +--+ + + +
| | | | | | | |
+ +--+ + +--+ + +--+
A fourth path:
+--+--+
|
+--+ +
| | |
+ +--+
is the same as the second one in the row above after a 90-degree rotation.
All paths starting E are the same as the corresponding ones starting N after reflection in the forward diagonal.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,walk,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|