login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100605 Numbers n such that (prime(n)-1)! + prime(n)^2 is prime. 1
1, 2, 4, 10, 26 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

n={1, 2, 4, 10, 26} yields primes p(n)={2, 3, 7, 29, 101}. There are no more such n up to n=100. Verified by Ray Chandler.

LINKS

Table of n, a(n) for n=1..5.

J. V. Post, Math Pages.

FORMULA

Numbers n such that (prime(n)-1)! + prime(n)^2 is prime, where prime(n) is the n-th prime.

EXAMPLE

a(3) = 4 because (prime(4)-1)! + prime(4)^2 = (7-1)! + 7^2 = 720 + 49 = 769

is prime and is the 3rd such prime of that form.

CROSSREFS

Cf. A100858.

Sequence in context: A085633 A111564 A007021 * A247395 A183947 A154322

Adjacent sequences:  A100602 A100603 A100604 * A100606 A100607 A100608

KEYWORD

nonn

AUTHOR

Jonathan Vos Post, Nov 30 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 24 00:27 EST 2017. Contains 295164 sequences.