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.

A386779 Array read by descending antidiagonals: T(n,k) is the number of ways to partition an n X n X n cube into k noncongruent cuboids excluding cube-shaped parts.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 1
10 0
11 0
12 0
13 2
14 1
15 0
16 0
17 0
18 2
19 3
20 2
21 0
22 0
23 0
24 1
25 10
26 8
27 2
28 0
29 0
30 0
31 0
32 21
33 43
34 11
35 3
36 0
37 0
38 0
39 0
40 37
41 179
42 81
43 19
44 3
45 0
46 0
47 0
48 0
49 38
50 644
51 513
52 177
53 23
54 4
55 0
56 0
57 0
58 0
59 15
60 2068
61 3024
62 1471
63 260
64 35
65 4
66 0
67 0
68 0
69 0
70 4
71 4995
72 17489
73 11776
74 2736
75 458
76 40
77 5

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 0, 2, 3, 2, 0, 0, 0, 1, 10, 8, 2, 0, 0, 0, 0, 21, 43, 11, 3, 0, 0, 0, 0, 37, 179, 81, 19, 3, 0, 0, 0, 0, 38, 644, 513, 177, 23, 4, 0, 0, 0, 0, 15, 2068, 3024, 1471, 260, 35, 4, 0, 0, 0, 0, 4, 4995, 17489, 11776, 2736, 458, 40, 5]