%I A144487
%S A144487 17,19,23,31,47,79,271,1039,2063,4111,32783,65551,4194319,8388623,
%T A144487 67108879,1073741839,4294967311,1099511627791,4398046511119,
%U A144487 70368744177679,2305843009213693967,4722366482869645213711
%N A144487 Primes of the form 2^(n+1)+15.
%C A144487 Conjecture: Let n>=0 If 2^n+6 =/=[(p^2-3)/2] mod (p) then 2^(n+1)+15=p 
               (prime number) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), 
               Feb 21 2009]
%o A144487 (PARI) {for(n=0, 72, if(isprime(k=2^n+15), print1(k, ",")))}
%Y A144487 Cf. A057197 (numbers n such that 2^n + 15 is prime). [From Klaus Brockhaus 
               (klaus-brockhaus(AT)t-online.de), Dec 11 2008]
%Y A144487 Sequence in context: A106932 A007635 A140947 this_sequence A108266 A102325 
               A038711
%Y A144487 Adjacent sequences: A144484 A144485 A144486 this_sequence A144488 A144489 
               A144490
%K A144487 nonn
%O A144487 1,1
%A A144487 Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Dec 09 2008
%E A144487 Edited by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and R. J. 
               Mathar (mathar(AT)strw.leidenuniv.nl), Dec 10 2008