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 A165138 #20 Apr 06 2016 16:09:55
%S A165138 7,7,17,19,23,61,29,43,59,53,43,97,53,79,59,89,83,73,79,107,181,127,
%T A165138 131,113,109,113,151,167,193,149,151,167,197,163,197,163,229,199,179,
%U A165138 281,347,241,263,229,257,223,271,331,239,313,269,263,313,263,269,359,293
%N A165138 Smallest prime p > prime(n) such that p+prime(n) is a semiprime.
%C A165138 Except for having an additional first term the sequence coincides with A084704.
%C A165138 For n>2, a(n)-prime(n) is a multiple of 12, e.g., 17-5, 19-7, 23-11, etc. - _Zak Seidov_, Oct 15 2015
%H A165138 T. D. Noe, <a href="/A165138/b165138.txt">Table of n, a(n) for n = 1..1000</a>
%e A165138 2+7=9=3*3 (semiprime), 3+7=10=2*5 (semiprime), 5+17=22=2*11 (semiprime).
%t A165138 sp[n_]:=Module[{np=NextPrime[n]},While[PrimeOmega[n+np]!=2,np= NextPrime[ np]]; np]; sp/@Prime[Range[60]] (* _Harvey P. Dale_, Apr 06 2016 *)
%o A165138 (PARI) a(n) = {q = prime(n); p = nextprime(q+1); while (bigomega(p+q)!=2, p = nextprime(p+1)); p;} \\ _Michel Marcus_, Oct 15 2015
%Y A165138 Cf. A084704, A001358, A145471.
%K A165138 nonn
%O A165138 1,1
%A A165138 _Zak Seidov_, Sep 04 2009
%E A165138 Prior Mathematica program deleted by _Harvey P. Dale_, Apr 06 2016