|
| |
|
|
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.
|
|
0
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
