[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A346124
Numbers m such that no self-avoiding walk of length m + 1 on the square lattice fits into the smallest circle that can enclose a walk of length m.
6
1, 4, 6, 8, 12, 14, 15, 16, 18, 20, 21, 23, 24, 25, 26, 27, 28, 32, 34, 36, 38, 44, 46, 48, 52, 56, 58, 60
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Closed walks are allowed.
LINKS
Table of n, a(n) for n=1..28.
Hugo Pfoertner, Examples of paths of maximum length.
EXAMPLE
See link for illustrations of terms corresponding to diameters D < 8.5.
CROSSREFS
The squared radii of the enclosing circles are a subset of A192493/A192494.
Cf. A037245, A122224, A127399, A127400, A127401, A266549, A316194, A346993, A346994, A346995.
Cf. A346123-A346132 similar to this sequence with other sets of turning angles.
Sequence in context: A179852 A281020 A110606 * A241124 A117247 A249722
Adjacent sequences: A346121 A346122 A346123 * A346125 A346126 A346127
KEYWORD
nonn,more
AUTHOR
Hugo Pfoertner and Markus Sigg, Jul 30 2021
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 7 14:19 EST 2024. Contains 377535 sequences.
License Agreements, Terms of Use, Privacy Policy