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.

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.

Table of values

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

List of values

[327080, 84, 52, 32, 18, 24, 24, 24, 24, 24, 18, 24, 24, 24, 24, 24, 24, 24, 24, 30, 24, 30, 30, 24, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 36, 30, 36, 36, 30, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 40, 36, 36, 40, 36, 40, 42]

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

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