login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
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
Sequence in context: A227569 A344786 A011014 * A358305 A292590 A080901
KEYWORD
nonn,walk,more
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 3 17:12 EDT 2024. Contains 372221 sequences. (Running on oeis4.)