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”).

Number of certain self-avoiding walks with n steps on square lattice (see reference for precise definition).
(Formerly M3242)
1

%I M3242 #14 Dec 27 2018 07:57:49

%S 0,1,0,0,0,4,5,6,11,31,72,157,312,700,1472,3446,7855

%N Number of certain self-avoiding walks with n steps on square lattice (see reference for precise definition).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H W. A. Beyer and M. B. Wells, <a href="http://dx.doi.org/10.1016/0097-3165(72)90024-6">Lower bound for the connective constant of a self-avoiding walk on a square lattice</a>, J. Combin. Theory, A 13 (1972), 176-182, Table I.

%Y Cf. A002976.

%K walk,nonn,more

%O 4,6

%A _N. J. A. Sloane_