login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100600 Numbers k such that (prime(k)-1)! + prime(k)^6 is prime. 2
3, 4, 29, 32, 133 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
k = {3, 4, 29, 32, 133} yields primes p(n) = {5, 7, 109, 131, 751}. There are no more such k up to k=100. Computed in collaboration with Ray Chandler.
a(6) > 600. - Jinyuan Wang, Apr 10 2020
LINKS
FORMULA
Numbers k such that (prime(k)-1)! + prime(k)^6 is prime, where prime(k) is the k-th prime.
EXAMPLE
a(1) = 3 because (prime(3)-1)! + prime(3)^6 = (5-1)! + 5^6 = 15649 is the smallest prime of that form.
MATHEMATICA
lst={}; Do[p=Prime[n]; If[PrimeQ[(p-1)!+p^6], AppendTo[lst, n]], {n, 10^2}]; lst (* Vladimir Joseph Stephan Orlovsky, Sep 08 2008 *)
CROSSREFS
Sequence in context: A298561 A226049 A354844 * A345022 A288868 A076001
KEYWORD
nonn,hard,more
AUTHOR
Jonathan Vos Post, Nov 30 2004
EXTENSIONS
a(5) from Jinyuan Wang, Apr 10 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)