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].

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].

Terms

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

External references