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

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

4,4

REFERENCES

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.

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

FORMULA

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

CROSSREFS

Sequence in context: A011435 A139309 A011014 * A080901 A137260 A153059

Adjacent sequences:  A002973 A002974 A002975 * A002977 A002978 A002979

KEYWORD

nonn,walk,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:34 EST 2012. Contains 205860 sequences.