Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122224
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122224 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. +0
8
1, 4, 8, 14, 21, 32, 40 (list; graph; listen)
OFFSET

2,2

COMMENT

The path may be open or closed. For larger n several solutions with the same number of segments exist.

LINKS

Hugo Pfoertner, Examples of compact self avoiding paths on a square lattice.

CROSSREFS

Cf. A122223, A122226.

Sequence in context: A088804 A027924 A006578 this_sequence A004797 A053459 A024398

Adjacent sequences: A122221 A122222 A122223 this_sequence A122225 A122226 A122227

KEYWORD

hard,more,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research