Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #18 Jul 24 2023 05:57:03
%S 1,32,360,2304,10618
%N a(n) is the minimal value of Sum_{i=1..n} Product_{j=1..8} r_j(i), where each r_j is a permutation of {1,2,...,n}.
%C See arXiv link for sets of permutations that achieve the value of a(n).
%H Chai Wah Wu, <a href="http://arxiv.org/abs/1508.02934">Permutations r_j such that ∑i∏j r_j(i) is maximized or minimized</a>. arXiv:1508.02934 [math.CO], 2015.
%Y Cf. A000292 (two permutations), A070735 (three permutations), A070736 (four permutations), A260356 (five permutations), A260357 (six permutations), A260358 (seven permutations), A260355.
%K nonn,more
%O 1,2
%A _Chai Wah Wu_, Jul 28 2015