OFFSET
1,2
COMMENTS
a(n) is the number of 2n-step closed self-avoiding paths on the cubic lattice. - Bert Dobbelaere, Jan 04 2019
REFERENCES
B. D. Hughes, Random Walks and Random Environments, Oxford 1995, vol. 1, p. 462.
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
M. E. Fisher and M. F. Sykes, Excluded-volume problem and the Ising model of ferromagnetism, Phys. Rev. 114 (1959), 45-58.
B. J. Hiley and M. F. Sykes, Probability of initial ring closure in the restricted random-walk model of a macromolecule, J. Chem. Phys., 34 (1961), 1531-1537.
M. F. Sykes, D. S. McKenzie, M. G. Watts, and J. L. Martin, The number of self-avoiding walks on a lattice, J. Phys. A 5 (1972), 661-666.
FORMULA
a(n) = 4*n*A001409(n). - Sean A. Irvine, Jul 27 2020
CROSSREFS
KEYWORD
nonn,walk,more
AUTHOR
EXTENSIONS
a(11)-a(12) from Bert Dobbelaere, Jan 04 2019
a(13)-a(16) (using A001409) from Alois P. Heinz, Feb 28 2024
STATUS
approved