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 A137516 #18 Feb 13 2015 02:17:54
%S A137516 0,3,7,11,23,19,23,47,31,35,71,43,87,131,55,59,119,179,71,143,79,83,
%T A137516 167,91,183,275,103,207,311,115,119,239,359,131,263,139,143,287,431,
%U A137516 155,311,163,327,491,175,351,527,1403,191,383,199,203,407,211,215,431,223,447,671
%N A137516 Let 2n = p + q where p and q are primes. Take the p and q that produce the smallest product, then set a(n) = p*q - 2n.
%C A137516 Trying to translate the Goldbach conjecture into multiplication.
%H A137516 Isaac E. Lambert and Charles R Greathouse IV, <a href="/A137516/b137516.txt">Table of n, a(n) for n = 2..10000</a> (first 100 terms from Lambert)
%e A137516 For example, the 13th term of the sequence is 43 since 26 = 3 + 23 (and the product 69 is minimal) and 3*23 - 26 = 43.
%t A137516 f[n_] := Block[{p = 2}, While[ !PrimeQ[ 2n - p], p = NextPrime@ p]; 2n(p - 1) - p^2]; Array[f, 59, 2] (* _Robert G. Wilson v_, Mar 25 2012 *)
%o A137516 (PARI) a(n)=n+=n;forprime(p=2,default(primelimit),if(isprime(n-p),return(p*n-p^2-n))) \\ _Charles R Greathouse IV_, Mar 26 2012
%K A137516 nonn,easy
%O A137516 2,2
%A A137516 _Isaac Lambert_, Apr 23 2008
%E A137516 Edited by _N. J. A. Sloane_, May 23 2008