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 A235727 #6 Jan 15 2014 20:32:41
%S A235727 7,11,19,23,41,73,83,109,197,211,229,271,379,461,541,631,641,659,859,
%T A235727 991,1031,1049,1051,1093,1103,1217,1429,1451,1879,2063,2131,2287,2341,
%U A235727 2411,3019,3257,3461,3659,3673,3691,3709,3917,3967,4409,4463,4519,5279,5303,5471,5477
%N A235727 Odd primes p with (p^2 - 1)/4 - prime((p - 1)/2) and (p^2 - 1)/4 + prime((p - 1)/2) both prime.
%C A235727 By the conjecture in A235728, this sequence should have infinitely many terms.
%H A235727 Zhi-Wei Sun, <a href="/A235727/b235727.txt">Table of n, a(n) for n = 1..10000</a>
%e A235727 a(1) = 7 since neither (3^2-1)/4 - prime((3-1)/2) = 1 nor (5^2-1)/4 + prime((5-1)/2) = 9 is prime, but (7^2-1)/4 - prime((7-1)/2) = 12 - 5 = 7 and (7^2-1)/4 + prime((7-1)/2) = 12 + 5 = 17 are both prime.
%t A235727 q[n_]:=q[n]=PrimeQ[n(n+1)-Prime[n]]&&PrimeQ[n(n+1)+Prime[n]]
%t A235727 n=0;Do[If[q[(Prime[k]-1)/2],n=n+1;Print[n," ",Prime[k]]],{k,2,1000}]
%Y A235727 Cf. A000040, A232353, A235592, A235661, A235681, A235682, A235703, A235728.
%K A235727 nonn
%O A235727 1,1
%A A235727 _Zhi-Wei Sun_, Jan 15 2014