login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of polygons made of uncrossed knight's paths of length 2*n on an infinite board.
4

%I #14 Jan 27 2019 18:59:19

%S 0,3,13,178,3031,64866

%N Number of polygons made of uncrossed knight's paths of length 2*n on an infinite board.

%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a323134.htm">Illustrations of uncrossed Knight's path polygons</a>, (2019).

%e See Pfoertner link.

%Y Cf. A003192, A157416, A258206, A266549, A284869, A316198.

%K nonn,hard,more

%O 1,2

%A _Hugo Pfoertner_, Jan 05 2019