1,1

Next term, if it exists, is bigger than 489 digits (the 1279th convergent to sqrt(2)). - Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 08 2006

For[n = 2, n < 1500, n++, a := Join[{1}, Table[2, {i, 2, n}]]; If[PrimeQ[Denominator[FromContinuedFraction[a]]], If[PrimeQ[Numerator[FromContinuedFraction[a]]], Print[Numerator[FromContinuedFraction[a]]]]]] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 09 2006

(PARI) cfracnumdenomprime(m, f) = { default(realprecision, 3000); cf = vector(m+10); x=f; for(n=0, m, i=floor(x); x=1/(x-i); cf[n+1] = i; ); for(m1=0, m, r=cf[m1+1]; forstep(n=m1, 1, -1, r = 1/r; r+=cf[n]; ); numer=numerator(r); denom=denominator(r); if(ispseudoprime(numer)&&ispseudoprime(denom), print1(numer", "); numer2=numer; denom2=denom); ) default(realprecision, 28); }

Sequence in context: A018971 A006383 A080581 this_sequence A019018 A018993 A106965

Adjacent sequences: A086394 A086395 A086396 this_sequence A086398 A086399 A086400

frac,more,nonn

Cino Hilliard (hillcino368(AT)gmail.com), Sep 06 2003

More terms from Cino Hilliard (hillcino368(AT)gmail.com), Jan 15 2005

Edited by N. J. A. Sloane, Aug 06 2009 at the suggestion of R. J. Mathar