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 A218862 #9 Dec 07 2012 19:53:14
%S A218862 2,0,3,35,71,1151,1079,4199,11879,7559,32759,30239,75599,171359,
%T A218862 241919,251999,262079,393119,604799,665279,1572479,1834559,2827439,
%U A218862 2570399,2358719,7862399,7814015,5405399,6683039,18017999,20180159,8648639,17992799,17297279
%N A218862 The least number having n representations as p*q - p - q for primes p <= q.
%C A218862 a(72) > 2^32. - _Donovan Johnson_, Dec 07 2012
%H A218862 Donovan Johnson, <a href="/A218862/b218862.txt">Table of n, a(n) for n = 0..71</a>
%e A218862 The values of a(n) and (p,q) for n = 1 to 6:
%e A218862 0 is (2,2).
%e A218862 3 is (2,5), (3,3).
%e A218862 35 is (2,37), (3,19), (7,7).
%e A218862 71 is (2,73), (3,37), (5,19), (7,13).
%e A218862 1151 is (2,1153), (3,577), (7,193), (13,97), (17,73).
%e A218862 1079 is (3,541), (5,271), (7,181), (11,109), (19,61), (31,37).
%t A218862 nn = 10000; ps = Prime[Range[PrimePi[nn + 1]]]; t = Table[0, {nn}]; Do[n = p*q - p - q; If[p <= q && 0 < n <= nn, t[[n]]++], {p, ps}, {q, ps}]; t = Join[{1}, t]; u = Union[t]; c = Complement[Range[Max[u]], u]; If[c == {}, mx = u[[-1]], mx = c[[-1]] - 1]; Table[Position[t, n, 1, 1][[1, 1]] - 1, {n, 0, mx}]
%Y A218862 Cf. A157187.
%K A218862 nonn
%O A218862 0,1
%A A218862 _T. D. Noe_, Dec 06 2012