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 A140794 #36 Oct 05 2023 13:11:09
%S A140794 0,2,3,7,10,11,12,14
%N A140794 One of the four smallest counterexamples to the conjecture that the cardinality of the sumset is less than or equal to the cardinality of the difference set of every finite set of integers.
%C A140794 This sequence is the reflection of A102282: a(n) = 14 - A102282(9-n).
%C A140794 Keywords: sum-dominant sets, MSTD sets.
%C A140794 A set with more sums than differences is called an MSTD set. Hegarty has constructed many such examples.
%C A140794 Comment from _N. J. A. Sloane_, Mar 10 2013: Out of the 2^n subsets S of [0..n-1], let
%C A140794 AG(n) = number of S with |S+S|>|S-S|,
%C A140794 AE(n) = number of S with |S+S|=|S-S|,
%C A140794 AL(n) = number of S with |S+S|<|S-S|.
%C A140794 A140794 says AG(n) = 0 for n <= 14. These three sequences are respectively A222807, A118544, A222808.
%H A140794 P. V. Hegarty, <a href="https://dx.doi.org/10.4064/aa130-1-4">Some explicit constructions of sets with more sums than differences</a>, Acta Arith., 130 (2007), 61-77.
%H A140794 Greg Martin and Kevin O'Bryant, <a href="http://arxiv.org/abs/math/0608131">Many sets have more sums than differences</a>, arXiv:math/0608131 [math.NT], 2006.
%H A140794 Melvyn B. Nathanson, <a href="http://arxiv.org/abs/0807.2073">Problems in Additive Number Theory, III: Thematic Seminars at the Centre de Recerca Matematica</a>, arXiv:0807.2073 [math.NT], 2008.
%e A140794 Let A = {0, 2, 3, 7, 10, 11, 12, 14}. Then the cardinality of the sumset, |A + A| = 26, while the cardinality of the difference set, |A - A| = 25.
%Y A140794 Cf. A222807, A118544, A222808.
%K A140794 fini,full,nonn
%O A140794 1,2
%A A140794 _Jonathan Vos Post_, Jul 15 2008
%E A140794 Corrected by _James Wilcox_, Jul 24 2013