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 A094711 #9 May 29 2021 19:52:46 %S A094711 7,31,223,2311,30047,510569,9699713,223092949,6469693331,200560490213, %T A094711 7420738135049,304250263527281,13082761331670179,614889782588491777, %U A094711 32589158477190044803,1922760350154212639981,117288381359406970983583 %N A094711 Larger of a pair (p,q) of primes with (p+q)/2=prime(n)# and q-p is minimal. %C A094711 a(n) = Min{p prime: (p+q)/2=prime(n)# for another prime q<p}; %C A094711 a(n) = A002110(n) + A094709(n); (a(n) + A094710(n))/2 = A002110(n). %o A094711 (Python) %o A094711 from sympy import isprime, prime, primerange %o A094711 def aupton(terms): %o A094711 phash, alst = 2, [] %o A094711 for p in primerange(3, prime(terms)+1): %o A094711 phash *= p %o A094711 for k in range(1, phash//2): %o A094711 if isprime(phash-k) and isprime(phash+k): alst.append(phash+k); break %o A094711 return alst %o A094711 print(aupton(18)) # _Michael S. Branicky_, May 29 2021 %Y A094711 Cf. A002110, A094709, A094710. %K A094711 nonn %O A094711 2,1 %A A094711 _Reinhard Zumkeller_, May 21 2004 %E A094711 Corrected by _T. D. Noe_, Nov 15 2006 %E A094711 More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 01 2008