cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A386251 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.

Table of values

n a(n)
2 60
3 28
4 20
5 22
6 18
7 16
8 18
9 18
10 16
11 18
12 18
13 18
14 20
15 20
16 18
17 20
18 20
19 20
20 22
21 22
22 22
23 24
24 24
25 22
26 24
27 24
28 24
29 26
30 24
31 24
32 26
33 26
34 26
35 26
36 26
37 26
38 28
39 28
40 28
41 28
42 30
43 28
44 30
45 30
46 30
47 30
48 30
49 30
50 32
51 32
52 32
53 32
54 32
55 32
56 32
57 34
58 34
59 34
60 34
61 34
62 36
63 34
64 34
65 36
66 36

List of values

[60, 28, 20, 22, 18, 16, 18, 18, 16, 18, 18, 18, 20, 20, 18, 20, 20, 20, 22, 22, 22, 24, 24, 22, 24, 24, 24, 26, 24, 24, 26, 26, 26, 26, 26, 26, 28, 28, 28, 28, 30, 28, 30, 30, 30, 30, 30, 30, 32, 32, 32, 32, 32, 32, 32, 34, 34, 34, 34, 34, 36, 34, 34, 36, 36]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.