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!)
A258420 Number of partitions of the 6-dimensional hypercube resulting from a sequence of n bisections, each of which splits any part perpendicular to any of the axes, such that each axis is used at least once. 2

%I #5 May 29 2015 16:25:47

%S 95040,6308280,259518600,8563232700,249224561040,6703099068120,

%T 171052924578480,4209175565848800,100941470303368480,

%U 2376150752752629210,55182874193888254800,1268931845185709426820,28968880808493233206500,657875495503038733415880

%N Number of partitions of the 6-dimensional hypercube resulting from a sequence of n bisections, each of which splits any part perpendicular to any of the axes, such that each axis is used at least once.

%H Alois P. Heinz, <a href="/A258420/b258420.txt">Table of n, a(n) for n = 6..700</a>

%p b:= proc(n, k, t) option remember; `if`(t=0, 1, `if`(t=1,

%p A(n-1, k), add(A(j, k)*b(n-j-1, k, t-1), j=0..n-2)))

%p end:

%p A:= proc(n, k) option remember; `if`(n=0, 1,

%p -add(binomial(k, j)*(-1)^j*b(n+1, k, 2^j), j=1..k))

%p end:

%p T:= proc(n, k) option remember;

%p add(A(n, k-i)*(-1)^i*binomial(k, i), i=0..k)

%p end:

%p a:= n-> T(n, 6):

%p seq(a(n), n=6..25);

%Y Column k=6 of A255982.

%K nonn

%O 6,1

%A _Alois P. Heinz_, May 29 2015

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 August 22 09:18 EDT 2024. Contains 375369 sequences. (Running on oeis4.)