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,1

References

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

Links

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

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

Formula

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

Mathematica

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

Crossrefs

Cf. A155934, A288583, A289434.

Sequence in context: A128112 A122669 A071942 * A134849 A096056 A050501

Adjacent sequences: A289186 A289187 A289188 * A289190 A289191 A289192

Keyword

nonn

Author

Robert Price, Aug 13 2017

Status

approved