[go: up one dir, main page]

login
A143246
Number of (directed) Hamiltonian circuits in the n X n grid graph.
6
0, 2, 0, 12, 0, 2144, 0, 9277152, 0, 934520913216, 0, 2152453777211211412, 0, 112252999240982874562527216, 0, 131765033045251672652319572331061144, 0, 3467852755777932367855581588111341658695967892, 0
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Grid Graph
Eric Weisstein's World of Mathematics, Hamiltonian Cycle
Ed Wynn, Enumeration of nonisomorphic Hamiltonian cycles on square grid graphs, arXiv preprint arXiv:1402.0545 [math.CO], 2014.
CROSSREFS
Cf. A003763 (number of undirected cycles on 2n X 2n grid graph).
Cf. A222065 (A222065(n) = a(2n)).
Sequence in context: A156431 A067994 A236219 * A286198 A287079 A286965
KEYWORD
nonn
AUTHOR
Eric W. Weisstein, Aug 01 2008
STATUS
approved