login
A323133
Number of symmetric uncrossed unrooted knight's paths of length n on an infinite board.
3
1, 6, 7, 29, 46, 170, 299, 969
OFFSET
1,2
COMMENTS
A path is considered as symmetric if its "spine", i.e., the connection of the end points of the moves by straight lines, has mirror or point symmetry. The non-symmetric details of a single move are ignored.
EXAMPLE
See Pfoertner link.
CROSSREFS
KEYWORD
nonn,walk,more,hard
AUTHOR
Hugo Pfoertner, Jan 05 2019
STATUS
approved