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 A037151 #25 May 22 2022 14:30:38
%S A037151 2,3,7,29,127,727,5051,40343,362897,3628811,39916801,479001629,
%T A037151 6227020867,87178291219,1307674368043,20922789888023,355687428096031,
%U A037151 6402373705728037,121645100408832089,2432902008176640029,51090942171709440031,1124000727777607680031
%N A037151 Smallest prime > n!.
%H A037151 Hugo Pfoertner, <a href="/A037151/b037151.txt">Table of n, a(n) for n = 1..450</a>
%H A037151 Antonín Čejchan, Michal Křížek, and Lawrence Somer, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL25/Krizek/krizek3.html">On Remarkable Properties of Primes Near Factorials and Primorials</a>, Journal of Integer Sequences, Vol. 25 (2022), Article 22.1.4.
%F A037151 a(n) = A151800(A000142(n)) = A000142(n) + A033932(n).
%t A037151 PrimeNext[n_]:=Module[{k},k=n+1;While[ !PrimeQ[k],k++ ];k]; Table[PrimeNext[n! ],{n,40}] (* _Vladimir Joseph Stephan Orlovsky_, May 30 2010 *)
%t A037151 Table[NextPrime[n!],{n,25}] (* _Harvey P. Dale_, Dec 12 2010 *)
%o A037151 (Python)
%o A037151 from sympy import factorial, nextprime
%o A037151 def a(n): return nextprime(factorial(n))
%o A037151 print([a(n) for n in range(1, 23)]) # _Michael S. Branicky_, May 22 2022
%Y A037151 Cf. A000142, A033932, A087421, A151800.
%K A037151 nonn
%O A037151 1,1
%A A037151 _Jud McCranie_
%E A037151 Extended by _Ray Chandler_, Mar 07 2010