Consider the graph whose vertices are the points of the n-dimensional cubic lattice with points connected by all integer-length diagonals that traverse all n dimensions and do not intersect intermediate points. a(n) is the total length of the shortest possible closed walk in this graph via noncongruent diagonals of the same length.
A385525
Consider the graph whose vertices are the points of the n-dimensional cubic lattice with points connected by all integer-length diagonals that traverse all n dimensions and do not intersect intermediate points. a(n) is the total length of the shortest possible closed walk in this graph via noncongruent diagonals of the same length.
Terms
- a(0) =327080a(1) =84a(2) =52a(3) =32a(4) =18a(5) =24a(6) =24a(7) =24a(8) =24a(9) =24a(10) =18a(11) =24a(12) =24a(13) =24a(14) =24a(15) =24a(16) =24a(17) =24a(18) =24a(19) =30a(20) =24a(21) =30a(22) =30a(23) =24a(24) =30a(25) =30a(26) =30a(27) =30a(28) =30a(29) =30
External references
- oeis: A385525