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!)
 A153440 Numbers k such that k^9*(k^9+1)+1 is prime. 8
 1, 2, 11, 44, 45, 56, 62, 63, 110, 170, 219, 234, 245, 261, 263, 333, 395, 398, 402, 413, 428, 434, 437, 498, 557, 558, 578, 633, 692, 695, 723, 731, 750, 761, 774, 794, 797, 804, 806, 846, 854, 855, 863, 906, 923, 926, 977, 1046, 1085, 1086 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS It seems numbers of the form k^n*(k^n+1)+1 with n > 0, k > 1 may be primes only if n has the form 3^j. When n is even, k^(4*n)+k^(2*n)+1=(k^(2*n)+1)^2-(k^n)^2=(k^(2*n)+k^n+1)*(k^(2*n)-k^n+1) so composite. But why if n odd > 3 and not a power of 3, k^n*(k^n+1)+1 is always composite? LINKS Pierre CAMI, Table of n, a(n) for n=1,...,38019 MATHEMATICA k9pQ[n_]:=Module[{c=n^9}, PrimeQ[c(c+1)+1]]; Select[Range[1200], k9pQ] (* Harvey P. Dale, Oct 29 2014 *) Select[Range[1100], PrimeQ[(#^9 (#^9 + 1)) + 1] &] (* Vincenzo Librandi, Jan 17 2015 *) PROG (MAGMA) [n: n in [0..1100] | IsPrime(n^9*(n^9+1)+1)]; // Vincenzo Librandi, Jan 17 2015 CROSSREFS Cf. A153438. Sequence in context: A027253 A241712 A066058 * A289645 A181369 A037744 Adjacent sequences:  A153437 A153438 A153439 * A153441 A153442 A153443 KEYWORD nonn AUTHOR Pierre CAMI, Dec 26 2008 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 September 22 07:34 EDT 2020. Contains 337289 sequences. (Running on oeis4.)