|
Search: id:A001335
|
|
|
| A001335 |
|
Number of n-step polygons on hexagonal lattice.
(Formerly M4828 N2065)
|
|
+0
2
|
|
| 0, 0, 12, 24, 60, 180, 588, 1968, 6840, 24240, 87252, 318360, 1173744, 4366740, 16370700, 61780320, 234505140, 894692736, 3429028116, 13195862760, 50968206912
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice.
|
|
REFERENCES
|
M. E. Fisher and M. F. Sykes, Excluded-volume problem and the Ising model of ferromagnetism, Phys. Rev. 114 (1959), 45-58.
A. J. Guttmann, personal communication.
A. J. Guttmann, On Two-Dimensional Self-Avoiding Random Walks, J. Phys. A 17 (1984), 455-468.
J. L. Martin, M. F. Sykes and F. T. Hioe, Probability of initial ring closure for self-avoiding walks on the face-centered cubic and triangular lattices, J. Chem. Phys., 46 (1967), 3478-3481.
M. F. Sykes et al., The number of self-avoiding walks on a lattice, J. Phys. A 5 (1972), 661-666.
|
|
LINKS
|
G. Nebe and N. J. A. Sloane, Home page for hexagonal (or triangular) lattice A2
|
|
CROSSREFS
|
Equals 6*A003289(n-1), n>1.
Sequence in context: A098585 A087105 A063975 this_sequence A001041 A081751 A120360
Adjacent sequences: A001332 A001333 A001334 this_sequence A001336 A001337 A001338
|
|
KEYWORD
|
nonn,nice,walk
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
