OFFSET
0,1
LINKS
John Friedlander and Henryk Iwaniec, Using a parity-sensitive sieve to count prime values of a polynomial, PNAS February 18, 1997 94 (4) 1054-1058.
Wikipedia, Friedlander-Iwaniec theorem
Marek Wolf, Continued fractions constructed from prime numbers, arXiv:1003.4015 [math.NT], 2010, pp. 8-9.
EXAMPLE
1/(2 + 1/(5 + 1/(17 + 1/(17 + 1/(37 + 1/(41 + 1/(97 + 1/(97 + ...))))))))
0.45502481649017002236905280827974482410575554890507644...
MATHEMATICA
max = 1000; r = Reap[Do[n = a^2 + b^4; If[n <= max && PrimeQ[n], Sow[n]], {a, Sqrt[max]}, {b, max^(1/4)}]][[2, 1]]; u = Union[r, SameTest -> (False&)] ; RealDigits[FromContinuedFraction[Join[{0}, u]], 10, 103] // First
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Jean-François Alcover, Sep 25 2014
STATUS
approved