This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A367185 #36 Nov 11 2023 10:57:35
%S A367185 0,2,7,17,35,62,100,152,219,303,406,530,678,851,1051,1280,1540,1834,
%T A367185 2163,2529,2934,3380,3869,4403,4985,5616,6298,7033,7823,8670,9576,
%U A367185 10544,11575,12671,13834,15066,16369,17745,19196,20724,22332,24021,25793,27650,29594,31627
%N A367185 Largest cost for a permutation problem.
%C A367185 The problem is to maximize Sum_{i=1..n} i p(i) - Max_{j=1..n} j p(j) where p is a permutation of {1,...,n}.
%C A367185 The terms up to n = 100 were computed via integer linear programming.
%H A367185 Rob Pratt, <a href="/A367185/b367185.txt">Table of n, a(n) for n = 1..100</a>
%H A367185 CodeForces, <a href="https://codeforces.com/contest/1859/problem/C">Another Permutation Problem</a>
%H A367185 Mathematics Stack Exchange, <a href="https://math.stackexchange.com/questions/4751863/maximise-left-sum-i-1n-p-i-cdot-i-right-left-max-j-1n-p-j">Maximise ... with p permutation of size n.</a>
%H A367185 MathOverflow, <a href="https://mathoverflow.net/questions/458129/maximizing-a-sum-minus-its-maximal-summand">Maximizing a sum minus its maximal summand</a>
%e A367185 For n = 4, the best permutation is [1, 4, 3, 2], with a(4) = (1*1+2*4+3*3+4*2) - max(1*1,2*4,3*3,4*2) = 26 - 9 = 17.
%K A367185 nonn
%O A367185 1,2
%A A367185 _Rob Pratt_, Nov 10 2023