The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Jan 06 2019 12:57:22
%S 1,6,6,12,15,23,33,42,53,62,74,90,103
%N Length of the longest possible self avoiding path on the 2-dimensional honeycomb net 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. An upper bound for the number of segments is given by A127406(n).
%H Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a122223.pdf">Examples of compact self avoiding paths on a honeycomb net</a>.
%Y Cf. A122224, A122226, A127406.
%K hard,more,walk,nonn
%O 1,2
%A _Hugo Pfoertner_, Sep 25 2006, Feb 11 2007