login
A059393
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.
2
1, 3, 18, 74, 141, 314, 911, 1840, 3974, 7456, 26304
OFFSET
1,2
COMMENTS
a(n) <= A059363(1) + A059363(2) + ... + A059363(n)
LINKS
Sean A. Irvine, Java program (github)
EXAMPLE
For n=3, we have g(1)=2, g(2)=6, g(3)=10 with the sum a(3)=18.
CROSSREFS
Row sums of the triangle A207975.
Sequence in context: A305623 A280804 A152897 * A301820 A094033 A245580
KEYWORD
nonn,hard,more
AUTHOR
Naohiro Nomoto, Jan 29 2001
EXTENSIONS
Edited and a(6)-a(10) added by Max Alekseyev, Feb 22 2012
a(11) from Sean A. Irvine, Sep 21 2022
STATUS
approved