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 A121926 #43 Sep 08 2022 08:45:27
%S A121926 3,5,11,31,131,733,5057,40339,362903,3628829,39916831,479001637,
%T A121926 6227020841,87178291243,1307674368047,20922789888053,355687428096059,
%U A121926 6402373705728061,121645100408832067,2432902008176640071,51090942171709440073,1124000727777607680079
%N A121926 a(n) = prime(n) + n!.
%C A121926 It was conjectured by _Alexander R. Povolotsky_ and proved (in SeqFan email exchange) by _David L. Harden_ (with proof improvement from Daniel Berend) that no value of n exists such that ( n! + prime(n) ) yields an integral square. He also conjectured (see the link) that no value of n exists such that ( n! + prime(n) ) yields an integral m^k where k>1. - _Alexander R. Povolotsky_, Aug 13 2008
%H A121926 G. C. Greubel, <a href="/A121926/b121926.txt">Table of n, a(n) for n = 1..445</a>
%H A121926 Carlos Rivera, <a href="http://www.primepuzzles.net/conjectures/conj_059.htm">Conjecture 59</a>, The Prime Puzzles and Problems Connection.
%F A121926 Sum_{n>=1} 1/a(n) = 0.6657239270705138461513344444... - _Alexander R. Povolotsky_, Sep 22 2008
%t A121926 Table[Prime[n]+n!,{n,30}] (* _Harvey P. Dale_, Mar 23 2012 *)
%o A121926 (PARI) a(n)=prime(n) + n! \\ _Charles R Greathouse IV_, Jan 27 2015
%o A121926 (Magma) [NthPrime(n) + Factorial(n): n in [1..30]]; // _Vincenzo Librandi_, Mar 22 2015
%Y A121926 Cf. A063499.
%K A121926 nonn
%O A121926 1,1
%A A121926 _N. J. A. Sloane_, Aug 13 2008