A289189 Upper bound for certain restricted sumsets.

3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10

Offset: 1

Author

Robert Price, Aug 13 2017

Keywords

• nonn

References

• Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, Manuscript, May 2017. See Corollary C.56.

Links

• Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, arXiv:1705.07444 [math.NT], May 2017. See Corollary C.56.

Crossrefs

Cf. A155934, A288583, A289434.

Programs

Mathematica

Table[Floor[(Sqrt[4*n + 9] + 3)/2], {n, 100}]

Formula

a(n) = floor( (sqrt(4*n + 9) + 3) / 2).