|
Search: id:A072368
|
|
|
| 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]. |
|
+0
1
|
|
| 6, 54, 214, 594, 1334, 2614, 4645, 7676, 11992, 17912, 25791, 36022, 49028, 65270, 85247, 109493, 138575, 173094, 213694
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
For n=19, the smallest integer from each triple does not belong to range [1,19]. Triplicating the sets of triples, shifting each triple to the left, generates permutations as in A070735, but not provably minimal ones.
|
|
LINKS
|
Wouter Meeussen, Illustration of initial terms
|
|
EXAMPLE
|
a(7)=4645 because (1*20*21)+(2*18*19)+(3*15*16)+(4*13*14)+(5*8*17)+(6*10*12)+(7*9*11)=4645 is the smallest value attainable.
|
|
CROSSREFS
|
Cf. A070735.
Sequence in context: A109092 A068416 A097645 this_sequence A116138 A060774 A043026
Adjacent sequences: A072365 A072366 A072367 this_sequence A072369 A072370 A072371
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Wouter Meeussen (wouter.meeussen(AT)pandora.be), Jul 19 2002
|
|
|
Search completed in 0.002 seconds
|
