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 A086596 #13 Apr 03 2015 18:56:15
%S A086596 1,-1,3,-8,22,-53,158,-481,1471,-4621,14612
%N A086596 An invariant of the set {Log(2), Log(3), Log(5),..., Log(Prime(2n)), Log(Prime(2n+1))}.
%C A086596 This sequence comes from a corrected and extended example in the paper by Besser and Moree.
%H A086596 A. Besser, P. Moree, <a href="http://www.birkhauser.ch/journals/1300/papers/2079006/20790463.pdf">On an invariant related to a linear inequality</a>, Arch. Math. 79: pp. 463-471
%H A086596 D. Gijswijt and P. Moree, <a href="http://arxiv.org/abs/math/0309318">A set-theoretic invariant</a>, arXiv:math/0309318 (2003)
%F A086596 a(t)=(-1)^t/2 sum_{d|p_1...p_t, d <= sqrt{p_1...p_t} mu(d).
%t A086596 Invariant[a_List] := Module[{i=1, j=2, xMin, xMax, aa, n, invar=0, signs, x}, xMin=Abs[a[[i]]-a[[j]]]; xMax=a[[i]]+a[[j]]; aa=Complement[a, {a[[i]], a[[j]]}]; n=Length[aa]; Do[signs=(2*IntegerDigits[k, 2, n]-1); x=aa.signs; If[x>xMin&&x<xMax, invar+=Times@@signs], {k, 0, 2^n-1}]; invar]; Table[theSet=Table[N[Log[Prime[i]]], {i, 1, n}]; Invariant[theSet], {n, 3, 23, 2}]
%Y A086596 Cf. A068101.
%K A086596 hard,sign,more
%O A086596 1,3
%A A086596 _T. D. Noe_, Aug 01 2003