login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET

1,2

REFERENCES

R. K. Guy, Unsolved Problems in Number Theory, Section C9.

LINKS

Table of n, a(n) for n=1..26.

CROSSREFS

Sequence in context: A266082 A105195 A257569 * A083398 A221671 A301640

Adjacent sequences:  A039833 A039834 A039835 * A039837 A039838 A039839

KEYWORD

nonn

AUTHOR

John W. Layman

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 11:46 EDT 2019. Contains 322472 sequences. (Running on oeis4.)