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.

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, 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, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12

Offset

1,2

Links

Rob Pratt, Table of n, a(n) for n = 1..110

Sean A. Irvine, Java program (github)

Manuel Kauers and Christoph Koutschan, Some D-finite and some Possibly D-finite Sequences in the OEIS, arXiv:2303.02793 [cs.SC], 2023, p. 4.

Crossrefs

Sequence in context: A266082 A105195 A257569 * A083398 A221671 A301640

Adjacent sequences: A039833 A039834 A039835 * A039837 A039838 A039839

Keyword

nonn

Author

John W. Layman

Extensions

a(27)-a(63) from Sean A. Irvine, Feb 27 2021

Further terms from Rob Pratt, May 03 2021

Status

approved