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



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

(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
95040, 6308280, 259518600, 8563232700, 249224561040, 6703099068120, 171052924578480, 4209175565848800, 100941470303368480, 2376150752752629210, 55182874193888254800, 1268931845185709426820, 28968880808493233206500, 657875495503038733415880 (list; graph; refs; listen; history; text; internal format)



Alois P. Heinz, Table of n, a(n) for n = 6..700


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

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


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

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


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

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


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

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


Column k=6 of A255982.

Sequence in context: A216122 A206411 A128389 * A206105 A230734 A114660

Adjacent sequences:  A258417 A258418 A258419 * A258421 A258422 A258423




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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 12:24 EST 2021. Contains 349557 sequences. (Running on oeis4.)