|
%I #5 May 29 2015 16:24:39
%S 2162160,196756560,10778727960,463305056760,17266750912320,
%T 586609859314080,18699578507549520,569565504689176800,
%U 16777853060738524020,482011338862966969980,13586929812483090607600,377442353035435719228120,10367784656620152180344310
%N Number of partitions of the 7-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="/A258421/b258421.txt">Table of n, a(n) for n = 7..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, 7):
%p seq(a(n), n=7..25);
%Y Column k=7 of A255982.
%K nonn
%O 7,1
%A _Alois P. Heinz_, May 29 2015
|
