|
%I #16 Oct 28 2023 08:54:35
%S 1,3,18,74,141,314,911,1840,3974,7456,26304
%N Smallest possible sum of n positive integers g(1) < g(2) < ... < g(n) such that A001222(g(i)+g(j)) = A001222(g(i)) + A001222(g(j)) for all 1<=i<j<=n.
%C a(n) <= A059363(1) + A059363(2) + ... + A059363(n)
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a059/A059393.java">Java program</a> (github)
%e For n=3, we have g(1)=2, g(2)=6, g(3)=10 with the sum a(3)=18.
%Y Row sums of the triangle A207975.
%Y Cf. A001222, A059333, A059363.
%K nonn,hard,more
%O 1,2
%A _Naohiro Nomoto_, Jan 29 2001
%E Edited and a(6)-a(10) added by _Max Alekseyev_, Feb 22 2012
%E a(11) from _Sean A. Irvine_, Sep 21 2022
|
