login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 7
1, 6, 6, 12, 15, 23, 33, 42, 53, 62, 74, 90, 103 (list; graph; refs; listen; history; 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

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

CROSSREFS

Cf. A122224, A122226, A127406.

Sequence in context: A161418 A124691 A112437 * A046625 A029682 A014201

Adjacent sequences:  A122220 A122221 A122222 * A122224 A122225 A122226

KEYWORD

hard,more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Sep 25 2006, Feb 11 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 22:50 EST 2012. Contains 205684 sequences.