|
Search: id:A120443
|
|
|
| A120443 |
|
Number of Hamiltonian paths on n X n square grid of points. |
|
+0
2
|
|
| 1, 4, 20, 276, 4324, 229348, 13535280, 3023313284, 745416341496, 730044829512632, 786671485270308848, 3452664855804347354220, 16652005717670534681315580, 331809088406733654427925292528, 7263611367960266490262600117251524
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
J.-M. Mayer, C. Guez and J. Dayantis, Exact computer enumeration of the number of Hamiltonian paths in small square plane lattices, Physical Review B, Vol. 42 Number 1, 1990.
J. L. Jacobsen, Exact enumeration of Hamiltonian circuits, walks, and chains in two and three dimensions, J. Phys. A: Math. Theor. 40 (2007) 14667-14678
|
|
LINKS
|
Jesper L. Jacobsen (jesper.jacobsen(AT)u-psud.fr), Dec 12 2007, Table of n, a(n) for n = 1..17
|
|
EXAMPLE
|
a(3)=20.
|
|
CROSSREFS
|
Cf. A003763.
Sequence in context: A032081 A034235 A000847 this_sequence A053400 A120599 A012797
Adjacent sequences: A120440 A120441 A120442 this_sequence A120444 A120445 A120446
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David Bevan (dbevan(AT)emtex.com), Jul 19 2006
|
|
EXTENSIONS
|
More terms from Jesper L. Jacobsen (jesper.jacobsen(AT)u-psud.fr), Dec 12 2007
|
|
|
Search completed in 0.002 seconds
|
