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 A066953 #12 Apr 22 2025 02:43:41
%S A066953 1,1,11,104956945995541,
%T A066953 6458007542034006723505363870885661685813595082173513446600259282126155549185667752443
%N A066953 Integers of the form (k!+1)/prime(k).
%C A066953 The next term has more than 6.5*10^7 digits, if it exists. - _Amiram Eldar_, Apr 22 2025
%F A066953 a(n) = (A068000(n)!+1)/prime(A068000(n)). - _Amiram Eldar_, Apr 22 2025
%t A066953 f[k_] := (k! + 1)/Prime[k]; f /@ Select[Range[100], IntegerQ[f[#]] &] (* _Amiram Eldar_, Apr 22 2025 *)
%o A066953 (PARI) list(lim) = {my(k = 0, r = 1); forprime(p = 1, lim, k++; r *= k; if(!((r+1) % p), print1((r+1)/p, ", ")));} \\ _Amiram Eldar_, Apr 22 2025
%Y A066953 Cf. A068000.
%K A066953 nonn,hard
%O A066953 1,3
%A A066953 _Benoit Cloitre_, Feb 01 2002