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.

A386296 Array read by descending antidiagonals: T(n,k) is the number of ways to partition n X n X n cube into k noncongruent cuboids.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 0
6 1
7 0
8 0
9 1
10 1
11 0
12 0
13 2
14 1
15 1
16 0
17 0
18 4
19 3
20 2
21 1
22 0
23 0
24 2
25 12
26 8
27 2
28 1
29 0
30 0
31 1
32 31
33 47
34 11
35 3
36 1
37 0
38 0
39 0
40 70
41 209
42 85
43 19
44 3
45 1
46 0
47 0
48 0
49 115
50 846
51 560
52 183
53 23
54 4
55 1
56 0
57 0
58 0
59 97
60 3131
61 3508
62 1561
63 266
64 35
65 4
66 1
67 0
68 0
69 0
70 40
71 9533
72 21699
73 12960

List of values

[1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 0, 4, 3, 2, 1, 0, 0, 2, 12, 8, 2, 1, 0, 0, 1, 31, 47, 11, 3, 1, 0, 0, 0, 70, 209, 85, 19, 3, 1, 0, 0, 0, 115, 846, 560, 183, 23, 4, 1, 0, 0, 0, 97, 3131, 3508, 1561, 266, 35, 4, 1, 0, 0, 0, 40, 9533, 21699, 12960]