OFFSET
1,3
COMMENTS
The recurrence is a transform of the Babylonian (Newton's) method for square root computation: a(n+1)= N/2a(n)+a(n)/2 = (a(n)^2+N)/2a(n).
EXAMPLE
1/1=1.0, 1/1=1.0, 3/2=1.5, 7/5=1.4, 42/29=1.41379.., 577/408=1.4142156,... - R. J. Mathar, Nov 03 2016
MATHEMATICA
a[1] = a[2] = 1; a[n_] := (a[n - 1] a[n - 2] + 2)/(a[n - 1] + a[n - 2]); Denominator@ Array[ a, 12] (* Robert G. Wilson v, Aug 03 2010 *)
CROSSREFS
KEYWORD
nonn,frac
AUTHOR
Mark Dols, Jul 28 2010
EXTENSIONS
a(10) - a(12) from Robert G. Wilson v, Aug 03 2010
STATUS
approved