A122223 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.

1, 6, 6, 12, 15, 23, 33, 42, 53, 62, 74, 90, 103

Offset: 1

Author

Hugo Pfoertner, Sep 25 2006, Feb 11 2007

Keywords

• hard
• more
• walk
• nonn

Comments

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).

Links

• Hugo Pfoertner, Examples of compact self avoiding paths on a honeycomb net.

Crossrefs

Cf. A122224, A122226, A127406.