cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A255982 Number T(n,k) of partitions of the k-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; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 2
5 4
6 0
7 5
8 29
9 30
10 0
11 14
12 184
13 486
14 336
15 0
16 42
17 1148
18 5880
19 9744
20 5040
21 0
22 132
23 7228
24 64464
25 192984
26 230400
27 95040
28 0
29 429
30 46224
31 679195
32 3279060
33 6792750
34 6308280
35 2162160
36 0
37 1430
38 300476
39 7043814
40 51622600
41 165293700
42 259518600
43 196756560
44 57657600

List of values

[1, 0, 1, 0, 2, 4, 0, 5, 29, 30, 0, 14, 184, 486, 336, 0, 42, 1148, 5880, 9744, 5040, 0, 132, 7228, 64464, 192984, 230400, 95040, 0, 429, 46224, 679195, 3279060, 6792750, 6308280, 2162160, 0, 1430, 300476, 7043814, 51622600, 165293700, 259518600, 196756560, 57657600]