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.

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

Table of values

n a(n)
1 0
2 0
3 2
4 3
5 8
6 11
7 19
8 23
9 35
10 40
11 55
12 62
13 80
14 88
15 110
16 119
17 144
18 155
19 183
20 195
21 227
22 240
23 275
24 290
25 328
26 344
27 386
28 403
29 448
30 467
31 515
32 535
33 587
34 608
35 663
36 686
37 744
38 768
39 830
40 855
41 920
42 947
43 1015
44 1043
45 1115
46 1144
47 1219
48 1250
49 1328
50 1360
51 1442
52 1475
53 1560

List of values

[0, 0, 2, 3, 8, 11, 19, 23, 35, 40, 55, 62, 80, 88, 110, 119, 144, 155, 183, 195, 227, 240, 275, 290, 328, 344, 386, 403, 448, 467, 515, 535, 587, 608, 663, 686, 744, 768, 830, 855, 920, 947, 1015, 1043, 1115, 1144, 1219, 1250, 1328, 1360, 1442, 1475, 1560]