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.

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

Table of values

n a(n)
3 5
4 16
5 16
6 36
7 30
8 60
9 48
10 100
11 83
12 96
13 123
14 182
15 130
16 264
17 182
18 324
19 224
20 280
21 259
22 484
23 369
24 576
25 449
26 676
27 423
28 560
29 528
30 900
31 598
32 1008
33 638
34 1054
35 859
36 864
37 979
38 1330
39 884
40 1620
41 1054
42 1764
43 1152
44 1364
45 1185
46 2116
47 1553
48 2304
49 1713
50 2500
51 1513
52 1924
53 1760

List of values

[5, 16, 16, 36, 30, 60, 48, 100, 83, 96, 123, 182, 130, 264, 182, 324, 224, 280, 259, 484, 369, 576, 449, 676, 423, 560, 528, 900, 598, 1008, 638, 1054, 859, 864, 979, 1330, 884, 1620, 1054, 1764, 1152, 1364, 1185, 2116, 1553, 2304, 1713, 2500, 1513, 1924, 1760]