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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A248079 Least number k such that k^n + k - 1 is prime, or 0 if no such k exists. 0
2, 2, 3, 2, 0, 4, 6, 2, 4, 3, 0, 17, 36, 3, 3, 2, 0, 6, 9, 43, 27, 9, 0, 3, 154, 3, 34, 54, 0, 24, 24, 6, 226, 23, 0, 3, 70, 36, 13, 51, 0, 4, 13, 9, 10, 68, 0, 18, 10, 45, 154, 85, 0, 23, 6, 10, 37, 8, 0, 30, 331, 9, 3, 40, 0, 11, 61, 8, 10, 35, 0, 61, 76, 54, 426, 9, 0, 84, 87, 13, 46 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

If n == 5 mod 6 (A016969), k^n + k - 1 is always divisible by k^2 - k + 1. Thus it will never be prime.

LINKS

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

PROG

(PARI) a(n)=if(n==Mod(5, 6), return(0)); k=1; while(!isprime(k^n+k-1), k++); k

vector(100, n, a(n))

CROSSREFS

Cf. A016969, A045546, A236475, A236759, A113517.

Sequence in context: A292372 A098008 A234808 * A127638 A127639 A248081

Adjacent sequences:  A248076 A248077 A248078 * A248080 A248081 A248082

KEYWORD

nonn

AUTHOR

Derek Orr, Sep 30 2014

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 20 09:27 EDT 2019. Contains 324234 sequences. (Running on oeis4.)