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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001667 2n-step polygons on b.c.c. lattice.
(Formerly M5364 N2330)
0
96, 1776, 43776, 1237920, 37903776, 1223681760, 41040797376, 1416762272736, 50027402384640 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

COMMENTS

Number of 2n-step closed self-avoiding walks starting from the origin. - Bert Dobbelaere, Jan 16 2019

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

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=2..10.

M. E. Fisher and M. F. Sykes, Excluded-volume problem and the Ising model of ferromagnetism, Phys. Rev. 114 (1959), 45-58.

M. F. Sykes et al., The number of self-avoiding walks on a lattice, J. Phys. A 5 (1972), 661-666.

Index entries for sequences related to b.c.c. lattice

CROSSREFS

Cf. A001666.

Sequence in context: A128962 A071765 A064243 * A093984 A159711 A268636

Adjacent sequences:  A001664 A001665 A001666 * A001668 A001669 A001670

KEYWORD

nonn,nice,walk

AUTHOR

N. J. A. Sloane.

EXTENSIONS

a(9)-a(10) from Bert Dobbelaere, Jan 16 2019

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 June 26 20:24 EDT 2019. Contains 324380 sequences. (Running on oeis4.)