The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293559 Least prime p such that n*(p^n-1)-1 is prime. 1
 5, 2, 11, 2, 5, 29, 7, 2, 47, 71, 167, 2, 571, 23, 59, 2, 73, 53, 349, 5, 59, 1259, 769, 17, 1021, 1117, 73, 5, 1049, 5, 109, 137, 947, 29, 89, 1019, 67, 29, 97, 2, 2111, 569, 271, 53, 191, 5, 251, 113, 2029, 569, 17, 1453, 1049, 1151, 211, 7, 47, 677, 29 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Note that f_n(p) = n*(p^n-1)-1 = n*p^n-(n+1) is irreducible over the rationals as a polynomial in p: if n <> 8 Eisenstein's criterion applies to either f_n(p) or its reversal -(n+1)*p^n+n, using Mihailescu's theorem. Thus the generalized Bunyakovsky conjecture implies a(n) always exists. - Robert Israel, Oct 24 2017 LINKS Iain Fox, Table of n, a(n) for n = 1..1000 EXAMPLE For n=5, 5*(5^5-1)-1 = 15619 is prime, but 5*(p^5-1)-1 is not prime for primes p < 5, so a(5)=5. MAPLE f:= proc(n) local p;   p:= 2;   while not isprime(n*(p^n-1)-1) do p:= nextprime(p) od:   p end proc: map(f, [\$1..100]); # Robert Israel, Oct 24 2017 MATHEMATICA Table[p=2; While[!PrimeQ[n (p^n - 1) - 1], p=NextPrime@p]; p, {n, 100}] PROG (PARI) a(n) = forprime(p=2, , if(ispseudoprime(n*(p^n-1)-1), return(p))) \\ Iain Fox, Oct 23 2017 CROSSREFS Cf. A283450. Sequence in context: A050004 A111187 A257323 * A094683 A094685 A095396 Adjacent sequences:  A293556 A293557 A293558 * A293560 A293561 A293562 KEYWORD nonn AUTHOR Vincenzo Librandi, Oct 12 2017 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.

Last modified November 29 06:32 EST 2021. Contains 349416 sequences. (Running on oeis4.)