This site is supported by donations to The OEIS Foundation. Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A242927 Numbers n such that k^n + (k+1)^n + ... + (k+n-1)^n is prime for some k. 2
 1, 2, 6, 42, 1806 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(5) > 500. For n-values < 500 not listed above, k has been checked for k <= 5000. For the first four terms, the least k that makes k^n + (k+1)^n + ... + (k+n-1)^n prime is {2, 1, 4, 99} respectively. For a(5) = 1806, k = 3081 yields a strong PRP with 6663 digits. - Don Reble, Mar 23 2018 The known terms a(1..5) coincide with the finite sequence A014117. - M. F. Hasler, May 20 2019 LINKS EXAMPLE k^1 = k is prime for k = 2 or any other prime (cf. A000040), so 1 is a member of this sequence. k^2 + (k+1)^2 is prime for some k (e.g., k = 2 yields 13, see A027861 for the full list), so 2 is a member of this sequence. k^3 + (k+1)^3 + (k+2)^3 = 3*(k+1)*(k^2+2*k+3) is never prime, therefore 3 is not a term of this sequence. Similarly, the corresponding expression for n = 4 and n = 5 is a multiple of 2 and 5, respectively, and for all n = 7, ..., 41, the expression also shares a factor with n (and thus is a multiple of n whenever n is prime). Index n = 110 is the smallest n > 42 for which the expression is not algebraically composite (the polynomial in k has content 1 and is irreducible over Q), but it does factor as (k(k+1)(k+2)(k+3)(k+4))^10 over Z_5, so is always a multiple of 5.) Index n = 210 is the next one which is a similar case. Index n = 231 is much like n = 110, but with a factor 7 instead of 5. Index n = 330 again yields an irreducible polynomial with content 1, but as before one can show that it is always divisible by 5. And so on. PROG (PARI) k(n)=for(k=1, 5000, if(ispseudoprime(sum(i=0, n-1, (k+i)^n)), return(k))) for(n=1, 500, if(k(n), print(n)))  \\ Edited by M. F. Hasler, Mar 23 2018 CROSSREFS Cf. A000040, A027861, A014117. Sequence in context: A115961 A123137 A014117 * A054377 A230311 A276416 Adjacent sequences:  A242924 A242925 A242926 * A242928 A242929 A242930 KEYWORD nonn,hard,more AUTHOR Derek Orr, May 26 2014 EXTENSIONS a(5) from Don Reble, Mar 23 2018 Example corrected and extended by M. F. Hasler, Apr 05 2018 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 December 9 23:05 EST 2019. Contains 329880 sequences. (Running on oeis4.)