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.

A039836

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.

Terms

    a(0) =1a(1) =2a(2) =3a(3) =3a(4) =4a(5) =4a(6) =4a(7) =5a(8) =5a(9) =5a(10) =5a(11) =5a(12) =6a(13) =6a(14) =6a(15) =6a(16) =6a(17) =6a(18) =7a(19) =7a(20) =7a(21) =7a(22) =7a(23) =7a(24) =8a(25) =8a(26) =8a(27) =8a(28) =8a(29) =8

External references