A143246 Number of (directed) Hamiltonian circuits in the n X n grid graph.

0, 2, 0, 12, 0, 2144, 0, 9277152, 0, 934520913216, 0, 2152453777211211412, 0, 112252999240982874562527216, 0, 131765033045251672652319572331061144, 0, 3467852755777932367855581588111341658695967892, 0

Offset

1,2

Links

Table of n, a(n) for n=1..19.

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.

Index entries for sequences related to graphs, Hamiltonian

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

Adjacent sequences: A143243 A143244 A143245 * A143247 A143248 A143249

Keyword

nonn

Author

Eric W. Weisstein, Aug 01 2008

Status

approved