OFFSET
1,2
COMMENTS
n can't be congruent to 2 mod 3, nor to 4 mod 5. - Robert Israel, Jun 24 2014
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
filter:= n -> isprime(1+add(n^(2*k+1), k=0..15));
select(filter, [$1..10000]); # Robert Israel, Jun 24 2014
MATHEMATICA
Select[Range[100], PrimeQ[1 + Sum[#^(2k + 1), {k, 0, 15}]] &] (* Alonso del Arte, Jun 24 2014 *)
Select[Range[4000], PrimeQ[Total[#^Range[1, 31, 2]] + 1] &] (* Vincenzo Librandi, Jun 28 2014 *)
PROG
(PARI) for(n=1, 10^4, if(ispseudoprime(sum(i=0, 15, n^(2*i+1))+1), print1(n, ", "))) \\ Derek Orr, Jun 24 2014
(Magma) [n: n in [0..5000] | IsPrime(s) where s is 1+&+[n^i: i in [1..31 by 2]]]; // Vincenzo Librandi, Jun 28 2014
(Sage)
i, n = var('i, n')
[n for n in (1..3100) if is_prime(1+(n^(2*i+1)).sum(i, 0, 15))] # Bruno Berselli, Jun 28 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Artur Jasinski, Dec 13 2006
EXTENSIONS
a(46)-a(51) from Derek Orr, Jun 24 2014
STATUS
approved