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 A244571 #18 Nov 18 2018 07:50:43
%S A244571 3,5,7,23,13,23,19,41,29,61,37,59,43,47,71,107,61,73,71,97,109,113,89,
%T A244571 157,113,103,107,127,167,127,131,149,139,179,163,163,181,227,173,251,
%U A244571 199,191,223,257,229,211,223,233,271,233,239,271,281,257,443,389,373
%N A244571 Smallest prime p >= prime(n) such that p*prime(n)-2 is prime.
%C A244571 See comment in A244572.
%H A244571 Jens Kruse Andersen, <a href="/A244571/b244571.txt">Table of n, a(n) for n = 2..10000</a>
%H A244571 V. Shevelev, <a href="https://arxiv.org/abs/0912.4006">Theorems on twin primes-dual case</a>, arXiv:0912.4006 [math.GM], 2009-2014. Sections 10, 14.
%t A244571 a[n_] := For[p = Prime[n], True, p = NextPrime[p], If[PrimeQ[p Prime[n] - 2], Return[p]]];
%t A244571 Table[a[n], {n, 2, 60}] (* _Jean-François Alcover_, Nov 18 2018 *)
%o A244571 (PARI) s=[]; for(n=2, 100, p=q=prime(n); while(!isprime(p*q-2), p=nextprime(p+1)); s=concat(s, p)); s \\ _Colin Barker_, Jun 30 2014
%Y A244571 Cf. A244570, A242719, A242720.
%K A244571 nonn
%O A244571 2,1
%A A244571 _Vladimir Shevelev_, Jun 30 2014
%E A244571 More terms from _Peter J. C. Moses_, Jun 30 2014