The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A231119 Least positive k such that n * k^k + 1 is a prime, or 0 if no such k exists. 4
 1, 1, 2, 1, 0, 1, 2, 17, 2, 1, 36, 1, 2, 3, 2, 1, 210, 1, 20, 3, 990, 1, 6, 2, 2, 6, 2, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS The number a(5) is conjectured to be zero. Four days of computation have shown that all numbers 5*k^k+1 are composite for k = 1..22733. - T. D. Noe, Nov 11 2013 The sum of 1/log(n*k^k) diverges slowly for every n so normal heuristics predict infinitely many primes in each case, including n=5. - Jens Kruse Andersen, Jun 16 2014 LINKS Table of n, a(n) for n=1..28. PROG (Java) import java.math.BigInteger; public class A231119 { public static void main (String[] args) { for (int n = 1; n < 3333; n++) { BigInteger nn = BigInteger.valueOf(n); for (int k=1; k<10000; k++) { BigInteger p = nn.multiply(BigInteger.valueOf(k).pow(k)).add(BigInteger.ONE); if (p.isProbablePrime(80)) { System.out.printf("%d, ", k); break; } else System.out.printf("."); } } } } CROSSREFS Cf. A035093, A057217, A175763, A228175. Sequence in context: A298878 A195982 A102761 * A129558 A353414 A267181 Adjacent sequences: A231116 A231117 A231118 * A231120 A231121 A231122 KEYWORD nonn,hard,more AUTHOR Alex Ratushnyak, Nov 04 2013 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.

Last modified June 12 23:56 EDT 2024. Contains 373362 sequences. (Running on oeis4.)