%I A061119
%S A061119 3,17,593,32993,2097593,8589935681
%N A061119 Primes in the sequence n^2 + 2^n (A001580).
%C A061119 p and p^2 + 2^p are both prime only for p=3. All positive n satisfy the 
               congruence n=3 (mod 6). - Lekraj Beedassy (lbeedassy(AT)hotmail.com), 
               Sep 07 2004
%C A061119 For values of n, see A064539. - Lekraj Beedassy (blekraj(AT)yahoo.com), 
               Jan 01 2007
%D A061119 J.-M. De Koninck & A. Mercier, 1001 Problemes en Theorie Classique Des 
               Nombres,Problem 165 pp. 30; 160, Ellipses Paris 2004.
%e A061119 a(3) = 593 = 2^9 +9^2. a(4) = 32993= 2^15 + 15^2.
%o A061119 (PARI) for(n=1,10^7, if(isprime(n^2+2^n),print(n^2+2^n)))
%Y A061119 Cf. A001580.
%Y A061119 Sequence in context: A009719 A128300 A001601 this_sequence A049985 A126579 
               A051710
%Y A061119 Adjacent sequences: A061116 A061117 A061118 this_sequence A061120 A061121 
               A061122
%K A061119 nonn
%O A061119 1,1
%A A061119 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 21 2001
%E A061119 More terms from Jason Earls (zevi_35711(AT)yahoo.com), Aug 09 2001. Next 
               term too large to include.