login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A308586
Number of (undirected) Hamiltonian paths on the n X n X n grid graph.
0
0, 72, 2480304, 27746717207772000
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,2
LINKS
Table of n, a(n) for n=1..4.
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
Adjacent sequences:
A308583
A308584
A308585
*
A308587
A308588
A308589
KEYWORD
nonn
,
hard
,
more
AUTHOR
Eric W. Weisstein
, Jun 09 2019
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified September 7 16:40 EDT 2024. Contains 375749 sequences. (Running on oeis4.)