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.

A384311 a(n) is the number of ways to partition an n X n X n cube into 4 noncongruent cuboids.

Table of values

n a(n)
1 0
2 0
3 4
4 12
5 47
6 85
7 183
8 266
9 466
10 613
11 941
12 1179
13 1668
14 2007
15 2701
16 3159
17 4079
18 4690
19 5868
20 6635
21 8122
22 9064
23 10874
24 12030
25 14196
26 15564
27 18142
28 19740
29 22739
30 24613
31 28065
32 30206
33 34174
34 36601
35 41087
36 43851
37 48888
38 51975
39 57631
40 61059
41 67331
42 71158
43 78078

List of values

[0, 0, 4, 12, 47, 85, 183, 266, 466, 613, 941, 1179, 1668, 2007, 2701, 3159, 4079, 4690, 5868, 6635, 8122, 9064, 10874, 12030, 14196, 15564, 18142, 19740, 22739, 24613, 28065, 30206, 34174, 36601, 41087, 43851, 48888, 51975, 57631, 61059, 67331, 71158, 78078]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.