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 A236248 #27 Jan 22 2014 09:00:04
%S A236248 2,5,6,10,29,132,266,322,350,538,667,693,776,977,1336,1810,1908,1980,
%T A236248 2175,2616,2716,3211,3473,5223,5630,5758,6585,6979,7964,8469,9052,
%U A236248 9758,10324,16876,25760,28171
%N A236248 Numbers m with C(2*m, m) - prime(m) prime, where C(2*m, m) = (2*m)!/(m!)^2.
%C A236248 According to the conjecture in A236256, this sequence should have infinitely many terms.
%C A236248 The prime C(2*a(36), a(36)) - prime(a(36)) = C(56342, 28171) - prime(28171) has 16959 decimal digits.
%C A236248 See A236249 for primes of the form C(2*m, m) - prime(m).
%C A236248 See also A236242 for a similar sequence.
%H A236248 Zhi-Wei Sun, <a href="/A236248/b236248.txt">Table of n, a(n) for n = 1..36</a>
%e A236248 a(1) = 2 since C(2*1, 1) - prime(1) = 2 - 2 = 0 is not prime, but C(2*2, 2) - prime(2) = 6 - 3 = 3 is prime.
%t A236248 n=0;Do[If[PrimeQ[Binomial[2m,m]-Prime[m]],n=n+1;Print[n," ",m]],{m,1,10000}]
%Y A236248 Cf. A000040, A000984, A236241, A236242, A236245, A236249, A236256.
%K A236248 nonn
%O A236248 1,1
%A A236248 _Zhi-Wei Sun_, Jan 21 2014