|
Search: id:A078523
|
|
|
| A078523 |
|
Primes of form a^2+b^6. |
|
+0
2
|
|
| 2, 5, 17, 37, 73, 89, 101, 113, 197, 233, 257, 353, 401, 577, 593, 677, 733, 829, 1129, 1153, 1213, 1289, 1297, 1433, 1601, 1753, 1913, 2089, 2273, 2917, 3089, 3137, 3229, 3313, 3433, 4093, 4177, 4217, 4289, 4357, 4457, 4721, 4937, 5393, 5477, 5689, 6121
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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.
|
|
LINKS
|
John Friedlander and Henryk Iwaniec, Using a parity-sensitive sieve to count prime values of a polynomial
|
|
EXAMPLE
|
73 = 3^2 + 2^6
|
|
MATHEMATICA
|
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]
|
|
CROSSREFS
|
Cf. A028916.
Sequence in context: A028916 A100272 A107630 this_sequence A078324 A002496 A127436
Adjacent sequences: A078520 A078521 A078522 this_sequence A078524 A078525 A078526
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
T. D. Noe (noe(AT)sspectra.com), Nov 26 2002
|
|
|
Search completed in 0.002 seconds
|
