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 A100595 #17 Jul 03 2024 16:42:51
%S A100595 9,10,17,137
%N A100595 Numbers k such that (prime(k)-1)! + prime(k)^9 is prime.
%C A100595 There are no more such k up to k=150. Computed in collaboration with _Ray Chandler_.
%C A100595 a(5) > 1000. - _Jinyuan Wang_, Apr 11 2020
%C A100595 a(5) > 2700. - _Michael S. Branicky_, Jul 03 2024
%F A100595 Numbers k such that (prime(k)-1)! + prime(k)^9 is prime, where prime(k) is the k-th prime.
%e A100595 a(1) = 9 because (prime(9)-1)! + prime(9)^9 = (23-1)! + 23^9 = 1124000729578760341463 is the smallest prime of this form.
%e A100595 a(2) = 10 because (prime(10)-1)! + prime(10)^9 = (29-1)! + 29^9 = 304888344611713875008649975869 is the 2nd smallest prime of this form.
%e A100595 a(3) = 17, but prime(17) = 59 yields a number that would take 2 full lines of this page; and a(4) = 137 because prime(137) = 773 yields a prime of this form which is 1975 digits long. Note also that 773 = prime(137) = prime(prime(34)).
%t A100595 lst={};Do[p=Prime[n];If[PrimeQ[(p-1)!+p^9], AppendTo[lst, n]], {n, 12^2}];lst (* _Vladimir Joseph Stephan Orlovsky_, Sep 08 2008 *)
%o A100595 (PARI) is(k) = ispseudoprime((prime(k)-1)! + prime(k)^9); \\ _Jinyuan Wang_, Apr 11 2020
%Y A100595 Cf. A100596, A100598, A100858.
%K A100595 nonn,hard,more
%O A100595 1,1
%A A100595 _Jonathan Vos Post_, Nov 30 2004