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 A212888 #12 May 31 2012 11:16:38
%S A212888 35,115,285,327,557,537,723,652,882,773,1061,916,1158,1069,1369,1143,
%T A212888 1436,1307,1566,1318,1711,1336,1752,1380,1798,1480,1847,1449,2012,
%U A212888 1556,1967,1599,2184,1646,2257,1656,2278,1779,2376,1786,2353,1823,2523,1832,2415
%N A212888 Conjectured number of positive even numbers that can be represented as the sum of two twin primes p + q in exactly n ways, with p >= q.
%C A212888 For even n, a(n) - a(n-1) increases as n increases.
%H A212888 T. D. Noe, <a href="/A212888/b212888.txt">Table of n, a(n) for n = 0..100</a>
%t A212888 p = Prime[Range[10000]]; tp = Select[p, PrimeQ[# + 2] || PrimeQ[# - 2] &]; {tn, t} = Transpose[Sort[Tally[Select[Flatten[Table[If[a >= b, a + b, 0], {a, tp}, {b, tp}]], # < tp[[-1]] &]]]]; Join[{Length[Complement[Range[2, tn[[-1]], 2], tn]]}, Table[Count[t, n], {n, 8}]] (* _T. D. Noe_, May 30 2012 *)
%Y A212888 Cf. A001097 (twin primes).
%Y A212888 Cf. A007534 (35 numbers that have no representation).
%Y A212888 Cf. A129363 (number of partitions of 2n into the sum of two twin primes).
%Y A212888 Cf. A212613 (last number having n representations).
%K A212888 nonn
%O A212888 0,1
%A A212888 _Michael Jones_, May 29 2012
%E A212888 Extended and corrected by _T. D. Noe_, May 30 2012