A072368 - cp's OEIS frontend

A072368 Minimal total volume of n bricks with integer sides, all sides being different. Lowest value of sum of products of triples pqr chosen from [1,3n].

n	a(n)
1	6
2	54
3	214
4	594
5	1334
6	2614
7	4645
8	7676
9	11992
10	17912
11	25791
12	36021
13	49028
14	65269
15	85247
16	109493
17	138575
18	173094
19	213694
20	261048
21	315863
22	378888
23	450907
24	532730
25	625213
26	729244
27	845748
28	975679
29	1120035
30	1279848
31	1456176
32	1650123
33	1862831
34	2095469
35	2349237

[6, 54, 214, 594, 1334, 2614, 4645, 7676, 11992, 17912, 25791, 36021, 49028, 65269, 85247, 109493, 138575, 173094, 213694, 261048, 315863, 378888, 450907, 532730, 625213, 729244, 845748, 975679, 1120035, 1279848, 1456176, 1650123, 1862831, 2095469, 2349237]

cp's OEIS Frontend

A072368 Minimal total volume of n bricks with integer sides, all sides being different. Lowest value of sum of products of triples pqr chosen from [1,3n].

Table of values

List of values

cp's OEIS Frontend

A072368 Minimal total volume of n bricks with integer sides, all sides being different. Lowest value of sum of products of triples p*q*r chosen from [1,3n].

Table of values

List of values

A072368 Minimal total volume of n bricks with integer sides, all sides being different. Lowest value of sum of products of triples pqr chosen from [1,3n].