Length of longest simple cycle without chords in the n-dimensional hypercube graph. Also called n-coil or closed n-snake-in-the-box problem.
A000937
Length of longest simple cycle without chords in the n-dimensional hypercube graph. Also called n-coil or closed n-snake-in-the-box problem.
Terms
- a(0) =0a(1) =4a(2) =6a(3) =8a(4) =14a(5) =26a(6) =48a(7) =96
External references
- oeis: A000937