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 A147853 #13 Mar 13 2025 15:36:57
%S A147853 5,7,11,17,19,19,29,37,37,37,73,47,59,71,97,79,79,101,97,137,227,137,
%T A147853 109,127,151,127,151,151,179,227,431,139,211,223,337,181,251,257,313,
%U A147853 227,257,227,263,491,307,241,409,263,277
%N A147853 Least prime p such that there is a prime q with (p+q)/2=A002110(n), the n-th primorial.
%C A147853 If q>10^22 then q is a probable prime. - _Pierre CAMI_, Jan 07 2014
%H A147853 Pierre CAMI, <a href="/A147853/b147853.txt">Table of n, a(n) for n = 2..1376</a>
%e A147853 For primorial=30, (p,q)=(7,53) as 7+53=2*30.
%o A147853 (PARI) ospp(N)= { i=4; while(1, Q=2*N-prime(i); if( ispseudoprime(2*N-prime(i)),print(N,", ",prime(i) );return(1) ); i++ ); /* end WHILE */ }
%Y A147853 Cf. A002110, A147517
%K A147853 easy,nonn
%O A147853 2,1
%A A147853 _Bill McEachen_, Nov 15 2008
%E A147853 Improved description from _T. D. Noe_