cp's OEIS Frontend

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.

A100598 Numbers k such that (prime(k)-1)! + prime(k)^8 is prime.

This page as a plain text file.
%I A100598 #23 Jul 03 2024 12:38:16
%S A100598 1,2,4,5,8,10
%N A100598 Numbers k such that (prime(k)-1)! + prime(k)^8 is prime.
%C A100598 k = {1, 2, 4, 5, 8, 10} yields primes p(k) = {2, 3, 7, 11, 19, 29}. There are no more such k up to k=100. Computed in collaboration with _Ray Chandler_.
%C A100598 a(7) > 600. - _Jinyuan Wang_, Apr 10 2020
%C A100598 a(7) > 900. - _Tyler NeSmith_, May 05 2021
%C A100598 a(7) > 2500. - _Michael S. Branicky_, Jul 03 2024
%e A100598 a(1) = 1 because (prime(1)-1)! + prime(1)^8 = (2-1)! + 2^8 = 257 is the smallest prime of that form.
%e A100598 a(5) = 8 because (prime(8)-1)! + prime(8)^8 = (19-1)! + 19^8 = 304888344611713861001750412961 is the 5th smallest prime of that form.
%t A100598 lst={};Do[p=Prime[n];If[PrimeQ[(p-1)!+p^8], AppendTo[lst, n]], {n, 10^2}];lst (* _Vladimir Joseph Stephan Orlovsky_, Sep 08 2008 *)
%o A100598 (PARI) is(k) = ispseudoprime((prime(k)-1)! + prime(k)^8); \\ _Jinyuan Wang_, Apr 10 2020
%Y A100598 Cf. A100595, A100599, A100858.
%K A100598 nonn,hard,more,less
%O A100598 1,2
%A A100598 _Jonathan Vos Post_, Nov 30 2004
%E A100598 Edited by _N. J. A. Sloane_ at the suggestion of _Andrew S. Plewe_, Jun 08 2007