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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263207 Number of integer solutions for Product_{k=1..n}(c(k) + 1) = 2 * Product_{k=1..n}(c(k) - 1) with 1 < c(k) <= c(k+1). 1
0, 1, 2, 20, 374, 21313, 5115140 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Geometrically interpreted, the sequence a(n) provides the number of distinct ways to cut an n-dimensional cube orthogonally into equally many outer parts, i.e., those that can be seen from the outside, and inner parts. All cuts must go through the whole body. c(k) is the number of cuts for the k-th dimension.

See section Example for all solutions for n=1 and n=2 and section Links for all solutions for n=3, n=4, n=5.

For any n>=1 the solution given by c(k)=A204321(k) for k=1..n-1 and c(n)=A204321(n)-1 always exists. Conjecture: there is no solution with a greater c(n). - Martin Janecke, Dec 01 2015

From Wolfdieter Lang, Dec 01 2015: (Start)

In terms of the j-th elementary symmetric functions sigma(n, j) in the indeterminates [c(1), ..., c[n]] the equation with the products can be rewritten as Sum_{j=0..n} ((1 - 2*(-1)^(n-j))*sigma(n, j) = 0, with sigma(n, 0) = 1.

If one uses the reciprocals x(k) = 1/c(k) then

  0 < x(k+1) <= x(k) <  1 (the c's are all >1, and finite), and the original equation becomes (by taking logarithms)

  Sum_{k=1..n} Artanh(x(k)) = log(2)/2 = Artanh(1/3), (which  is about .35).

  Here only positive terms appear. It is clear from the monotony of Artanh that all the x(k) < 1/3 for n >= 2, hence c(1) >= 4 for n >= 2.

(End)

LINKS

Table of n, a(n) for n=0..6.

M. Janecke, Kuchengerechtigkeit in n Dimensionen, includes a Python program that finds solutions for a given n, July 2015.

M. Janecke, On a conjecture about cutting hypercubes, Nov 2015.

Martin Janecke, All solutions for n=3

Martin Janecke, All solutions for n=4

Martin Janecke, All solutions for n=5

EXAMPLE

a(1) = 1, because there is exactly one solution: c(1) = 3.

a(2) = 2, because there are two solutions: c(1) = 4, c(2) = 11 and c(1) = 5, c(2) = 7. The first solution can be illustrated geometrically as a square cut into thirty outer and equally many inner parts:

    OOOOOOOOOOOO

    OIIIIIIIIIIO

    OIIIIIIIIIIO

    OIIIIIIIIIIO

    OOOOOOOOOOOO,

  The second solution yields twenty-four parts of each kind:

    OOOOOOOO

    OIIIIIIO

    OIIIIIIO

    OIIIIIIO

    OIIIIIIO

    OOOOOOOO.

CROSSREFS

Cf. A204321.

Sequence in context: A267827 A084948 A187661 * A218306 A009236 A078698

Adjacent sequences:  A263204 A263205 A263206 * A263208 A263209 A263210

KEYWORD

nonn,more

AUTHOR

Martin Janecke, Oct 12 2015

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 09:12 EDT 2022. Contains 353941 sequences. (Running on oeis4.)