|
|
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.
|
|
9
|
|
|
1, 6, 6, 12, 15, 23, 33, 42, 53, 62, 74, 90, 103
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,more,walk,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|