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 A096142 #9 Oct 14 2013 03:42:18
%S A096142 0,0,0,0,2,0,0,2,0,0,2,0,2,3,0,0,2,3,0,2,0,0,2,0,2,3,0,2,3,0,0,2,3,0,
%T A096142 2,0,0,2,3,0,2,0,2,3,0,2,3,4,0,2,0,0,2,0,0,2,0,2,3,4,6,5,6,0,2,0,2,3,
%U A096142 0,0,2,3,4,5,0,0,2,3,0,2,3,0,2,0,2,3,0,2,3,0,0,2,3,4,5,0,0,2,0
%N A096142 Let p(0) = 1, p(k) = k-th prime for k >= 1; write 2n = p(i) + p(j) with i <= j and i minimal; sequence gives i.
%e A096142 a(14)=3, because 28=5+23 (3rd and 9th prime) and 28-1, 28-2, 28-3 are not primes.
%o A096142 (PARI) a(n) = {tn = 2 * n; ideb = 0; ok = 0; while (! ok, if (ideb == 0, pj = tn -1, pj = tn - prime(ideb)); if (isprime(pj) || (pj == 1), ok = 1, ideb++);); return (ideb);} \\ _Michel Marcus_, Aug 29 2013
%K A096142 easy,nonn
%O A096142 1,5
%A A096142 _David Stroup_, Jul 23 2004
%E A096142 Terms corrected by _Michel Marcus_, Aug 29 2013