login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A006144
Number of certain self-avoiding walks with n steps on square lattice (see reference for precise definition).
(Formerly M3242)
1
0, 1, 0, 0, 0, 4, 5, 6, 11, 31, 72, 157, 312, 700, 1472, 3446, 7855
OFFSET
4,6
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
W. A. Beyer and M. B. Wells, Lower bound for the connective constant of a self-avoiding walk on a square lattice, J. Combin. Theory, A 13 (1972), 176-182, Table I.
CROSSREFS
Cf. A002976.
Sequence in context: A113005 A301423 A072623 * A047429 A301289 A310571
KEYWORD
walk,nonn,more
STATUS
approved