login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A308586
Number of (undirected) Hamiltonian paths on the n X n X n grid graph.
0
0, 72, 2480304, 27746717207772000
OFFSET
1,2
LINKS
R. D. Schram, H. Schiessel, Corrigendum: exact enumeration of Hamiltonian walks on the 4x4x4 cube and applications to protein folding, J. Phys. A: Math. Theor. 46 (2013) 485001.
Eric Weisstein's World of Mathematics, Grid Graph
Eric Weisstein's World of Mathematics, Hamiltonian Path
FORMULA
a(n) = A193346(n)/2.
CROSSREFS
Cf. A193346 (directed Hamiltonian paths).
Sequence in context: A028671 A261815 A159440 * A113889 A099191 A051325
KEYWORD
nonn,hard,more
AUTHOR
Eric W. Weisstein, Jun 09 2019
STATUS
approved