login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002976 Number of certain self-avoiding walks with n steps on square lattice (see reference for precise definition).
(Formerly M0034)
3
0, 1, 0, 2, 0, 5, 9, 21, 42, 76, 174, 396, 888, 2023, 4345, 9921, 22566 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,4

REFERENCES

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

LINKS

Table of n, a(n) for n=4..20.

W. A. Beyer, Letter to N. J. A. Sloane, 1980

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.

FORMULA

a(n) = A006142(n)+2*A006143(n)+A006144(n). - R. J. Mathar, Oct 22 2007

CROSSREFS

Cf. A001411, A037245.

Sequence in context: A243445 A227569 A011014 * A292590 A080901 A137260

Adjacent sequences:  A002973 A002974 A002975 * A002977 A002978 A002979

KEYWORD

nonn,walk,more

AUTHOR

N. J. A. Sloane

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 January 18 23:05 EST 2019. Contains 319282 sequences. (Running on oeis4.)