login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034166 Maximum length of 'zig-zag' self avoiding walk on an n X n lattice from a corner to opposite one. 3
0, 2, 4, 10, 12, 26, 36, 46, 60, 82, 100, 118, 140 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..13.

Robert Israel, Walks for n=2..13

Eric Weisstein's World of Mathematics, Self-avoiding Walk.

EXAMPLE

a(3)=4 because the maximum length among all 'zig-zag' self-avoiding walks on a 3 X 3 lattice is 4 steps.

CROSSREFS

Cf. A034165.

Sequence in context: A226827 A266538 A265223 * A301338 A181495 A092367

Adjacent sequences:  A034163 A034164 A034165 * A034167 A034168 A034169

KEYWORD

more,nonn,walk

AUTHOR

Felice Russo

EXTENSIONS

a(7) to a(11) computed by David W. Wilson

Definition revised and a(12)-a(13) computed by Luca Petrone, Dec 31 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 16:50 EDT 2021. Contains 347586 sequences. (Running on oeis4.)