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.

A346370 Upper bound for the number of solutions of the TRINTUM cube puzzle n X 1 X 1 (cuboid formed by 4n + 2 parts) different by the set of parts, which are distinguished by the amount of surface area they contribute to the assembled cuboid.

Table of values

n a(n)
1 3
2 8
3 10
4 19
5 22
6 34
7 38
8 54
9 59
10 78
11 84
12 107
13 114
14 140
15 148
16 178
17 187
18 220
19 230
20 267
21 278
22 318
23 330
24 374
25 387
26 434
27 448
28 499
29 514
30 568
31 584
32 642
33 659
34 720
35 738
36 803
37 822
38 890
39 910
40 982
41 1003
42 1078
43 1100
44 1179
45 1202
46 1284
47 1308
48 1394
49 1419
50 1508
51 1534
52 1627

List of values

[3, 8, 10, 19, 22, 34, 38, 54, 59, 78, 84, 107, 114, 140, 148, 178, 187, 220, 230, 267, 278, 318, 330, 374, 387, 434, 448, 499, 514, 568, 584, 642, 659, 720, 738, 803, 822, 890, 910, 982, 1003, 1078, 1100, 1179, 1202, 1284, 1308, 1394, 1419, 1508, 1534, 1627]