A045534 Number of squarefree self-avoiding walks in 2 dimensions.

1, 4, 8, 16, 16, 16, 16, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset

0,2

Links

Table of n, a(n) for n=0..84.

Anne E. Edlin, The Number of Square-Free Self-Avoiding Walks in 2-dimensions, web site for paper [Broken link]

Anne E. Edlin, The Number of Square-Free Self-Avoiding Walks in 2-dimensions, web site for paper [Cached copy, pdf version, with permission]

Anne E. Edlin, The Number of Square-Free Self-Avoiding Walks in 2-dimensions, the paper itself [Cached copy, pdf version, with permission]

Anne E. Edlin, Maple package "walk" [Cached copy, with permission]

Anne E. Edlin, Maple package "Squares" [Cached copy, with permission]

Formula

a(n) = 0 for n >= 8 [from Edlin]. - Sean A. Irvine, Mar 13 2021

Crossrefs

Cf. A038592.

Sequence in context: A312757 A312758 A099212 * A194433 A221565 A194435

Adjacent sequences: A045531 A045532 A045533 * A045535 A045536 A045537

Keyword

nonn,walk,easy

Author

Anne E. Edlin (anne(AT)euclid.math.temple.edu)

Extensions

More terms from Sean A. Irvine, Mar 13 2021

Status

approved