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.

A385151 a(n) is the least possible difference between the largest and smallest volumes of distinct three-cuboid combination filling an n X n X n cube.

Table of values

n a(n)
3 6
4 24
5 20
6 48
7 42
8 80
9 54
10 140
11 99
12 192
13 143
14 252
15 150
16 352
17 238
18 432
19 304
20 520
21 294
22 660
23 437
24 768
25 525
26 884
27 486
28 1064
29 696
30 1200
31 806
32 1344
33 726
34 1564
35 1015
36 1728
37 1147
38 1900
39 1014
40 2160
41 1394
42 2352
43 1548
44 2552
45 1350
46 2852
47 1833
48 3072
49 2009
50 3300
51 1734

List of values

[6, 24, 20, 48, 42, 80, 54, 140, 99, 192, 143, 252, 150, 352, 238, 432, 304, 520, 294, 660, 437, 768, 525, 884, 486, 1064, 696, 1200, 806, 1344, 726, 1564, 1015, 1728, 1147, 1900, 1014, 2160, 1394, 2352, 1548, 2552, 1350, 2852, 1833, 3072, 2009, 3300, 1734]