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.

A385154 a(n) is the least possible difference between the largest and smallest volumes of distinct five-cuboid combinations filling an n X n X n cube.

Table of values

n a(n)
3 10
4 12
5 21
6 28
7 28
8 62
9 42
10 80
11 57
12 112
13 114
14 143
15 90
16 156
17 191
18 288
19 184
20 224
21 252
22 396
23 299
24 288
25 315
26 504
27 414
28 546
29 462
30 720
31 529
32 816
33 616
34 837
35 609
36 648
37 777
38 1140
39 858
40 1260
41 874
42 1596
43 1237
44 1155
45 810
46 1554
47 1468
48 2064
49 1118
50 1950
51 1343
52 2080
53 1590
54 2268

List of values

[10, 12, 21, 28, 28, 62, 42, 80, 57, 112, 114, 143, 90, 156, 191, 288, 184, 224, 252, 396, 299, 288, 315, 504, 414, 546, 462, 720, 529, 816, 616, 837, 609, 648, 777, 1140, 858, 1260, 874, 1596, 1237, 1155, 810, 1554, 1468, 2064, 1118, 1950, 1343, 2080, 1590, 2268]