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

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A281570 Numbers n such that (n+1)^k + (-n)^k is prime for each k = 2, 3, 4, 5, 7, and 8. 0
 1, 9387629, 18276717, 40036062, 252447645, 293291802, 319596455, 327091015, 401241904, 421675344, 471333967, 483656680, 1059439524, 1162179372, 1651177394, 2339341839, 2423329650, 2596829984, 2749510742, 2903809499, 2941064795, 2956438949 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS For k = 6 and 9, (n+1)^k + (-n)^k is always composite (i.e. (n+1)^6 + (-n)^6 = (2*n^2+2*n+1)*(n^4+2*n^3+5*n^2+4*n+1), (n+1)^9 + (-n)^9 = (3*n^2+3*n+1)*(3*n^6+9*n^5+18*n^4+21*n^3+15*n^2+6*n+1)). LINKS EXAMPLE 9387629 is a term because 9387630^3 - 9387629^3, 9387630^5 - 9387629^5, 9387630^7 - 9387629^7 and 9387629^2 + 9387630^2, 9387629^4 + 9387630^4, 9387629^8 + 9387630^8 are prime numbers. CROSSREFS Cf. A027862, A128780. Sequence in context: A204510 A328207 A069376 * A274042 A066703 A270994 Adjacent sequences:  A281567 A281568 A281569 * A281571 A281572 A281573 KEYWORD nonn AUTHOR Altug Alkan and Thomas Ordowski, Feb 27 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 December 3 08:56 EST 2021. Contains 349445 sequences. (Running on oeis4.)