A034166 Maximum length of 'zig-zag' self avoiding walk on an n X n lattice from a corner to opposite one.

0, 2, 4, 10, 12, 26, 36, 46, 60, 82, 100, 118, 140

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 A364667 A181495

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