Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100605
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100605 Numbers n such that (prime(n)-1)! + prime(n)^2 is prime. +0
2
1, 2, 4, 10, 26 (list; graph; listen)
OFFSET

1,2

COMMENT

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

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 this_sequence A154322 A090031 A055775

Adjacent sequences: A100602 A100603 A100604 this_sequence A100606 A100607 A100608

KEYWORD

nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Nov 30 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research