The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A124178 Numbers n such that 1 + n + n^3 + n^5 + n^7 + n^9 + n^11 + n^13 + n^15 + n^17 + n^19 is prime. 16
 1, 3, 6, 33, 36, 61, 70, 99, 168, 229, 267, 268, 321, 325, 337, 366, 387, 448, 456, 457, 498, 513, 532, 546, 591, 621, 624, 637, 835, 858, 910, 927, 961, 981, 1045, 1125, 1213, 1237, 1242, 1257, 1341, 1357, 1437, 1458, 1461, 1462, 1482, 1491, 1572, 1579, 1581 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1800 MATHEMATICA Do[If[PrimeQ[1 + n + n^3 + n^5 + n^7 + n^9 + n^11 + n^13 + n^15 + n^17 + n^19], Print[n]], {n, 1, 1000}] Select[Range[3000], PrimeQ[Total[#^Range[1, 19, 2]] + 1] &] (* Vincenzo Librandi, Jun 28 2014 *) PROG (Magma) [n: n in [0..2000] | IsPrime(1 +n +n^3 +n^5 +n^7 +n^9 +n^11 +n^13 +n^15 +n^17 +n^19)]; // Vincenzo Librandi, Nov 12 2010 (PARI) is(n)=n==1 || isprime((n^21-n)/(n^2-1)+1) \\ Charles R Greathouse IV, Jul 02 2013 (Magma) [n: n in [0..2000] | IsPrime(s) where s is 1+&+[n^i: i in [1..19 by 2]]]; // Vincenzo Librandi, Jun 28 2014 (Sage) i, n = var('i, n') [n for n in (1..2000) if is_prime(1+(n^(2*i+1)).sum(i, 0, 9))] # Bruno Berselli, Jun 28 2014 CROSSREFS Cf. A049407, similar sequences listed in A244376. Sequence in context: A101751 A274999 A133665 * A284633 A192166 A297444 Adjacent sequences: A124175 A124176 A124177 * A124179 A124180 A124181 KEYWORD nonn,easy AUTHOR Artur Jasinski, Dec 13 2006 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 April 1 10:26 EDT 2023. Contains 361689 sequences. (Running on oeis4.)