The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A270205 Number of 2 X 2 planar subsets in an n X n X n cube. 2


%S 0,0,6,36,108,240,450,756,1176,1728,2430,3300,4356,5616,7098,8820,

%T 10800,13056,15606,18468,21660,25200,29106,33396,38088,43200,48750,

%U 54756,61236,68208,75690,83700,92256

%N Number of 2 X 2 planar subsets in an n X n X n cube.

%C 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.

%C 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"?

%C 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!

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

%C 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.

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

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

%H G. C. Greubel, <a href="/A270205/b270205.txt">Table of n, a(n) for n = 0..1000</a>

%H Craig Knecht, <a href="/A270205/a270205.pdf">Cube assembly from different 2x2 planar criteria</a>

%H Craig Knecht, <a href="/A270205/a270205.png">Most-perfect space</a>

%H Craig Knecht, <a href="/A270205/a270205_4.txt">F1 code most-perfect magic cube 960 examples</a>

%H Craig Knecht, <a href="/A270205/a270205.jpg">magic space</a>

%H Craig Knecht, <a href="/A270205/a270205_5.txt">F1 code reversible cube 960 examples</a>

%H Walter Trump, <a href="/A270205/a270205_1.pdf">Most-Perfect magic cube</a>

%H Walter Trump, <a href="/A270205/a270205_2.pdf">6 unique neighbors for the most-perfect magic cube</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Most-perfect_magic_square">Most-perfect magic square translated to a cube via the Hilbert space filling curve</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).

%F a(n) = 3*n^3 - 6*n^2 + 3*n.

%F From _Wesley Ivan Hurt_, Mar 13 2016: (Start)

%F G.f.: 6*x^2*(1+2*x)/(x-1)^4.

%F a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>3. (End)

%F E.g.f.: 3*x^2*(1+x)*exp(x). - _G. C. Greubel_, May 10 2016

%F a(n) = 6 * A002411(n-1) for n>=1. - _Joerg Arndt_, May 11 2016

%e The 2 X 2 X 2 cube labeled with the integers 1 to 8 has the following six 2 X 2 planar subsets each containing 4 cells: 1,2,3,4; 5,6,7,8; 1,2,5,6; 3,4,7,8; 1,4,5,8; 2,3,6,7.

%p A270205:=n->3*n^3-6*n^2+3*n: seq(A270205(n), n=0..50); # _Wesley Ivan Hurt_, Mar 13 2016

%t Table[3*n^3 - 6*n^2 + 3*n, {n, 0, 50}] (* _Wesley Ivan Hurt_, Mar 13 2016 *)

%t CoefficientList[Series[(6 (x^2 + 2 x^3))/(-1 + x)^4, {x, 0, 32}], x] (* _Michael De Vlieger_, Mar 15 2016 *)

%o (MAGMA) [3*n^3 - 6*n^2 + 3*n: n in [0..50]]; // _Wesley Ivan Hurt_, Mar 13 2016

%o (PARI) concat([0, 0], Vec(6*x^2*(1+2*x)/(x-1)^4 + O(x^100))) \\ _Altug Alkan_, Mar 14 2016

%o (PARI) a(n) = 3*n^3 - 6*n^2 + 3*n \\ _Charles R Greathouse IV_, Mar 15 2016

%Y Cf. A002411.

%K nonn,easy

%O 0,3

%A _Craig Knecht_, Mar 13 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 27 13:36 EDT 2021. Contains 346306 sequences. (Running on oeis4.)