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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129243 Least K such that K*(prime(n)^n)-1 is prime with prime(n)=n-th prime. 2
2, 2, 4, 2, 40, 6, 24, 14, 6, 14, 32, 54, 30, 108, 40, 110, 120, 182, 374, 20, 114, 2, 84, 80, 80, 110, 36, 78, 68, 200, 26, 228, 30, 12, 82, 294, 102, 530, 36, 98, 618, 2, 108, 734, 672, 404, 114, 458, 1102, 42, 154, 362, 998, 30, 58, 404, 28, 72, 434, 132, 266, 2, 308 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

2*(2^1)-1=3 prime so a(1)=2;

2*(3^2)-1=17 prime so a(2)=2;

4*(5^3)-1=2499 prime so a(3)=4;

2*(7^4)-1=4801 prime so a(4)=2.

PROG

(PARI) a(n) = {my(k=2, x=prime(n)^n); while (!isprime(k*x-1), k+=2); k; } \\ Michel Marcus, Sep 24 2019

CROSSREFS

Cf. A129244, A129245.

Sequence in context: A227509 A279094 A299148 * A013551 A252040 A084896

Adjacent sequences: A129240 A129241 A129242 * A129244 A129245 A129246

KEYWORD

nonn

AUTHOR

Pierre CAMI, Apr 05 2007

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 November 27 06:50 EST 2022. Contains 358362 sequences. (Running on oeis4.)