This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A289189 #36 Aug 15 2017 20:34:44
%S A289189 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,
%T A289189 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,
%U A289189 9,10,10,10,10,10,10,10,10,10,10,10,10,10
%N A289189 Upper bound for certain restricted sumsets.
%D A289189 Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, Manuscript, May 2017. See Corollary C.56.
%H A289189 Bela Bajnok, <a href="https://arxiv.org/abs/1705.07444">Additive Combinatorics: A Menu of Research Problems</a>, arXiv:1705.07444 [math.NT], May 2017. See Corollary C.56.
%F A289189 a(n) = floor( (sqrt(4*n + 9) + 3) / 2).
%t A289189 Table[Floor[(Sqrt[4*n + 9] + 3)/2], {n, 100}]
%Y A289189 Cf. A155934, A288583, A289434.
%K A289189 nonn
%O A289189 1,1
%A A289189 _Robert Price_, Aug 13 2017