A289189 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

(list; graph; refs; listen; history; text; internal format)

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}]