|
%I #8 Mar 02 2018 14:20:39
%S 1,4,8,14,21,32,40
%N Length of the longest possible self avoiding path on the 2-dimensional square lattice such that the path fits into a circle of diameter n.
%C The path may be open or closed. For larger n several solutions with the same number of segments exist.
%C It is conjectured that a(n) >= A123690(n)-1, i.e., that it is always possible to find a path visiting all grid points covered by a circle, irrespective of the position of its center. - _Hugo Pfoertner_, Mar 02 2018
%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a122224.pdf">Examples of compact self avoiding paths on a square lattice</a>.
%Y Cf. A122223, A122226, A123690.
%K hard,more,nonn
%O 2,2
%A _Hugo Pfoertner_, Sep 25 2006
|
