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 A038773 #18 May 26 2018 11:20:56
%S A038773 11,31,79,331,2531,30319,511039,9700357,223093769,6469694377,
%T A038773 200560491721,7420738136831,304250263529059,13082761331672803,
%U A038773 614889782588494961,32589158477190048817,1922760350154212643889,117288381359406970988027,7858321551080267055884131,557940830126698960967422909
%N A038773 a(n) is the smallest prime of the form Q + c, where Q is the n-th primorial and c is a composite >= prime(n+1)^2.
%C A038773 Between 2310 and 2531 there are 26 primes (2311, ..., 2521), all of which are of the form (primorial + prime). (2311 = 2 + 2309 (prime) = 2*3*5 + 2281 (prime); each of the other 25 primes is of the form 2*3*5*7*11 + prime.)
%C A038773 Observe that a(2) = 31 = 2*3 + 5^2 = 2*3*5 + 1, so it has two "primorial forms".
%H A038773 Michael De Vlieger, <a href="/A038773/b038773.txt">Table of n, a(n) for n = 1..100</a>
%e A038773 At n=5, the 5th primorial is A002110(5)=2310 and 2310 + 13*17 = 2310 + 221 = 2531 is the prime that meets the criteria of the definition.
%t A038773 Array[Block[{Q = Product[Prime@ i, {i, #}], c = Prime[# + 1]^2}, While[Nand[PrimeQ[Q + c], CompositeQ@ c], c++]; Q + c] &, 17] (* _Michael De Vlieger_, May 22 2018 *)
%o A038773 (PARI) a(n) = {my(pr = prod(k=1, n, prime(k)), c = prime(n+1)^2); while (isprime(c) || !isprime(pr + c), c++); pr + c;} \\ _Michel Marcus_, May 26 2018
%Y A038773 Cf. A002110, A054757, A054758, A005235.
%K A038773 nonn
%O A038773 1,1
%A A038773 _Labos Elemer_, May 04 2000
%E A038773 Edited by _Jon E. Schoenfield_, May 22 2018
%E A038773 More terms from _Michael De Vlieger_, May 22 2018