login
Maximal number m of integers s(i), with 1 <= s(1) < s(2) < ... < s(m) <= n, such that all sums s(i) + s(j), i<>j, are distinct.
1

%I #31 Sep 26 2023 16:42:22

%S 1,2,3,3,4,4,4,5,5,5,5,5,6,6,6,6,6,6,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,

%T 9,9,9,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,

%U 11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12

%N Maximal number m of integers s(i), with 1 <= s(1) < s(2) < ... < s(m) <= n, such that all sums s(i) + s(j), i<>j, are distinct.

%H Rob Pratt, <a href="/A039836/b039836.txt">Table of n, a(n) for n = 1..110</a>

%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a039/A039836.java">Java program</a> (github)

%H Manuel Kauers and Christoph Koutschan, <a href="https://arxiv.org/abs/2303.02793">Some D-finite and some Possibly D-finite Sequences in the OEIS</a>, arXiv:2303.02793 [cs.SC], 2023, p. 4.

%K nonn

%O 1,2

%A _John W. Layman_

%E a(27)-a(63) from _Sean A. Irvine_, Feb 27 2021

%E Further terms from _Rob Pratt_, May 03 2021