%I A078523
%S A078523 2,5,17,37,73,89,101,113,197,233,257,353,401,577,593,677,733,829,1129,
%T A078523 1153,1213,1289,1297,1433,1601,1753,1913,2089,2273,2917,3089,3137,3229,
%U A078523 3313,3433,4093,4177,4217,4289,4357,4457,4721,4937,5393,5477,5689,6121
%N A078523 Primes of form a^2+b^6.
%C A078523 Friedlander and Iwaniec prove that there are an infinite number of primes 
               of the form a^2+b^4 (A028916). They speculate that the a^2+b^6 case 
               can be proved by similar methods.
%H A078523 John Friedlander and Henryk Iwaniec, <a href="http://www.pnas.org/cgi/
               content/full/94/4/1054">Using a parity-sensitive sieve to count prime 
               values of a polynomial</a>
%e A078523 73 = 3^2 + 2^6
%t A078523 maxN=10000; lst={}; Do[p=i^2+j^6; If[p<maxN&&PrimeQ[p], AppendTo[lst, 
               p]], {i, maxN^(1/2)}, {j, maxN^(1/6)}]; lst=Union[lst]
%Y A078523 Cf. A028916.
%Y A078523 Sequence in context: A028916 A100272 A107630 this_sequence A078324 A002496 
               A127436
%Y A078523 Adjacent sequences: A078520 A078521 A078522 this_sequence A078524 A078525 
               A078526
%K A078523 easy,nonn
%O A078523 1,1
%A A078523 T. D. Noe (noe(AT)sspectra.com), Nov 26 2002