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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006142 Number of certain self-avoiding walks with n steps on square lattice (see reference for precise definition).
(Formerly M4355)
1
0, 0, 0, 0, 0, 1, 0, 1, 7, 17, 30, 49, 124, 321, 761, 1721, 3815 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,9

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 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: A294133 A088566 A059845 * A228345 A196167 A290402

Adjacent sequences:  A006139 A006140 A006141 * A006143 A006144 A006145

KEYWORD

nonn,walk

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 November 18 04:44 EST 2019. Contains 329248 sequences. (Running on oeis4.)