|
Search: id:A036418
|
|
|
| A036418 |
|
Number of self-avoiding polygons with perimeter n on hexagonal [ =triangular ] lattice. |
|
+0
2
|
|
| 0, 0, 2, 3, 6, 15, 42, 123, 380, 1212, 3966, 13265, 45144, 155955, 545690, 1930635, 6897210, 24852576, 90237582, 329896569, 1213528736, 4489041219, 16690581534, 62346895571, 233893503330, 880918093866, 3329949535934
(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
|
B. D. Hughes, Random Walks and Random Environments, Oxford 1995, vol. 1, p. 459.
|
|
LINKS
|
I. Jensen, Table of n, a(n) for n = 1..60 (from link below)
I. Jensen, More terms
G. Nebe and N. J. A. Sloane, Home page for hexagonal (or triangular) lattice A2
Index entries for sequences related to A2 = hexagonal = triangular lattice
|
|
CROSSREFS
|
Cf. A001334.
Adjacent sequences: A036415 A036416 A036417 this_sequence A036419 A036420 A036421
Sequence in context: A006403 A129960 A115098 this_sequence A120589 A110181 A141351
|
|
KEYWORD
|
nonn,walk
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
