cp's OEIS Frontend

This may also be construed as the number of line segments illustrating the isometric projection of a cube of side length n. Moreover, a(n) equals the number of rods making a cube of side length n+1 minus the number of rods making a cube of side length n. See the illustration in the links and formula below.

William H. Press looked at the hybrid structure of a most-perfect magic square and the Hilbert space filling curve and thought it might be the "most uniform" way of putting the consecutive integers in a 2-d square. He thought a definition of "most uniform" would be useful.

Al Zimmermann suggested this: Start by defining the "non-uniformity of a distribution of integers among the cells of a square [or cube or hypercube]" to be the standard deviation of the sums of the 2 X 2 planar subsets. Then define a "most uniform distribution of integers" to be a distribution with the smallest non-uniformity. For both the most-perfect square and most-perfect cube the non-uniformity is 0 and so each is a most uniform distribution. (Of course, you'd want a better word for "non-uniformity". Skewness?) Perhaps use "2 X 2 planar subset" instead of "2 X 2 partition"?

Comment from Dwane Campbell: For cubes, the definition of compact is that all 2 X 2 X 2 subcubes add to the same sum. That definition also includes wrap around. Your most perfect space cube is compact. It has the additional constraint that each orthogonal plane is also compact. There are 64 2 X 2 X 2 subcubes that add to 260 and 192 2 X 2 subsquares that add to 130 in your cube. I did not think either result was possible. Congratulations!

The most-perfect order 4 cube and the reversible order 4 cube are the new findings to look at in the link section.

Most-perfect magic squares require every 2 X 2 cell block to have the same sum. This sequence looks at that same subset in the cube.

Most-perfect space is defined as a structure where all these 2 X 2 subsets have the same sum.

What structure provides the most uniform distribution of integers in a cube?

a(n+1) is the number of unit faces required to make an n X n X n cubic lattice. Number of unit edges required for the same is A059986(n). - Mohammed Yaseen, Aug 22 2021

a(n-3) is the maximum sigma irregularity over all maximal 3-degenerate graphs with n vertices. The extremal graphs are 3-stars (K_3 joined to n-3 independent vertices). (The sigma irregularity of a graph is the sum of the squares of the differences between the degrees over all edges of the graph.) - Allan Bickle, Jun 14 2023

a(n) is the number of edges in a four-dimensional hypercube (a tesseract) having sides of length n.