login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A260359 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}. 3
1, 32, 360, 2304, 10618 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

See arXiv link for sets of permutations that achieve the value of a(n).

LINKS

Table of n, a(n) for n=1..5.

C. W. Wu, Permutations r_j such that ∑i∏j r_j(i) is maximized or minimized. arXiv:1508.02934 [math.CO], 2015.

CROSSREFS

Cf. A000292 (two permutations), A070735 (three permutations), A070736 (four permutations), A260356 (five permutations), A260357 (six permutations), A260358 (seven permutations), A260355.

Sequence in context: A200531 A302320 A303014 * A105250 A302818 A303511

Adjacent sequences:  A260356 A260357 A260358 * A260360 A260361 A260362

KEYWORD

nonn,more

AUTHOR

Chai Wah Wu, Jul 28 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 11 22:04 EST 2018. Contains 318052 sequences. (Running on oeis4.)