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 A222807 #41 Jun 04 2018 11:39:30
%S A222807 0,0,0,0,0,0,0,0,0,0,0,0,0,0,4,10,30,66,144,314,692,1452,3046,6388,
%T A222807 13298,27274,56164,113672,231892,470984,950178,1912700,3868034,
%U A222807 7772172,15651674,31464544,63154106,126603428,254088618,508541874,1018817124
%N A222807 Number of subsets A of {0,1,...,n-1} with |A+A| > |A-A|.
%C A222807 Some authors work with subsets of [0..n-1], others with subsets of [1..n].
%C A222807 Keywords: sum-dominant sets, MSTD sets.
%C A222807 a(1)-a(21) were computed by Daniel C. R. Scheinerman, Mar 10 2013; although a(1)-a(27) had been found by Kevin O'Bryant some time earlier.
%H A222807 <a href="/A222807/b222807.txt">Table of n, a(n) for n = 1..41</a>
%H A222807 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 A222807 D. Penman and M. Wells, <a href="http://www.emis.de/journals/INTEGERS/papers/n57/n57.Abstract.html">On Sets with More Restricted Sums than Differences</a>, Integers, Vol. 13 (2013), A57.
%F A222807 a(n) = Sum_{i=1..n} (n-i+1)*A224893(i).
%e A222807 The four examples illustrating a(15)=4 are (cf. A140794):
%e A222807 0 2 3 7 10 11 12 14,
%e A222807 0 2 3 4 7 11 12 14,
%e A222807 0 1 2 5 9 10 12 13 14,
%e A222807 0 1 2 4 5 9 12 13 14.
%Y A222807 Cf. A118544, A140794, A222808, A224893.
%K A222807 nonn,more
%O A222807 1,15
%A A222807 _N. J. A. Sloane_, Mar 10 2013
%E A222807 a(28)-a(35) from _James Wilcox_, Jul 22 2013
%E A222807 a(36)-a(40) from _Giovanni Resta_, Jul 23 2013
%E A222807 a(41) from _James Wilcox_, Jul 24 2013