The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A317888 The minimum value in the central cell of an n-dimensional cube, three cells wide in each dimension, such that each cell is the product of its adjacent cells, each cell is a whole number, and no two cells have the same value. 1
 6, 120, 362880, 355687428096000, 8683317618811886495518194401280000000, 8247650592082470666723170306785496252186258551345437492922123134388955774976000000000000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS We can prove that the corner cells are filled with values from 2 to 2^n+1, because in order to prove that none of the corner cells have to skip a value so as not to repeat a value within any of the other cells, we must prove that the non-corner cells all have values greater than 2^n+1 in at least one arrangement of corner cell values. 2(2^n-n+2) can describe the lowest value of cells in between two corner cells in every dimension from one to infinity, excluding the third dimension, because in the ideal arrangement of the three-dimensional grid, 12 must appear between 3 and 4, while the formula returns the value 14. Regardless, 12 is still greater than 2^n+1, which is 9 in three dimensions. Every value for 2(2^n-n+2) is greater than 2^n+1 as can clearly be observed from a graph. The formula 2(2^n-n+2) was derived from the fact that the smallest non-corner values appear next to 2 in every dimension except the third, and next to 3 in the first three dimensions. So with the exclusion of the third dimension due to its limited number of corner cells, these values must be equal to the product of 2 and the lowest number that is paired with 2. The lowest number that is paired with 2 in an ideal arrangement of values is always equal to one less than the number of dimensions, n-1, subtracted from the highest corner value, 2^n+1, thus resulting in 2^n+1-(n-1), or in its simplified form, 2^n-n+2. When multiplying this by two, we receive the lowest non-corner value possible in every dimension except the third. LINKS Aidan Clarke, Table of n, a(n) for n = 1..8 (shortened by N. J. A. Sloane, Jan 17 2019) FORMULA a(n) = (2^n+1)!. a(n) = A000142(A000051(n)). - Michel Marcus, Aug 11 2018 EXAMPLE One arrangement for n=2 is:    2   10   5    8  120  15    4   12   3 a(2) = 120 because this is the minimum possible value for the central cell. CROSSREFS Cf. A000051, A000142. Sequence in context: A040996 A110442 A137149 * A053710 A336389 A126244 Adjacent sequences:  A317885 A317886 A317887 * A317889 A317890 A317891 KEYWORD nonn,easy AUTHOR Aidan Clarke, Aug 10 2018 STATUS approved

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

Last modified August 15 14:44 EDT 2022. Contains 356146 sequences. (Running on oeis4.)