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 A236245 #10 Apr 12 2014 13:15:02
%S A236245 263,937,3449,12889,2704193,10400641,35345263867,
%T A236245 23623985175715118288974865541854103729347,
%U A236245 362048725489728431058442528694228154899210914562190067
%N A236245 Primes of the form C(2*m, m) + prime(m), where C(2*m, m) = (2*m)!/(m!)^2.
%C A236245 Although the primes in this sequence are very rare, by the conjecture in A236241 there should be infinitely many such primes.
%C A236245 See A236242 for a list of known numbers m with C(2*m, m) + prime(m) prime.
%H A236245 Zhi-Wei Sun, <a href="/A236245/b236245.txt">Table of n, a(n) for n = 1..25</a>
%e A236245 a(1) = 263 since C(2*5, 5) + prime(5) = 252 + 11 = 263 is prime, and those C(2*m, m) + prime(m) with 0 < m < 5 are composite.
%t A236245 s[n_]:=Binomial[2n,n]+Prime[n]
%t A236245 a[n_]:=s[A236242(n)]
%t A236245 Table[a[n],{n,1,40}]
%Y A236245 Cf. A000040, A000984, A236241, A236242.
%K A236245 nonn
%O A236245 1,1
%A A236245 _Zhi-Wei Sun_, Jan 20 2014