The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A289189 Upper bound for certain restricted sumsets. 0
 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 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

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.

Last modified August 14 07:04 EDT 2020. Contains 336477 sequences. (Running on oeis4.)