A323133 Number of symmetric uncrossed unrooted knight's paths of length n on an infinite board.

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.

Links

Table of n, a(n) for n=1..8.

Hugo Pfoertner, Illustrations of symmetric uncrossed knight's paths of length <= 6, (2019).

Example

See Pfoertner link.

Crossrefs

Cf. A003192, A306176, A306178, A323131, A323132, A323134.

Sequence in context: A037956 A095369 A006493 * A348950 A292106 A037375

Adjacent sequences: A323130 A323131 A323132 * A323134 A323135 A323136

Keyword

nonn,walk,more,hard

Author

Hugo Pfoertner, Jan 05 2019

Status

approved