A179907 -id:A179907 - cp's OEIS frontend

A179823 Denominators in the approximation of sqrt(2) satisfying the recurrence: a(n)= [a(n-1)*a(n-2)+2]/[a(n-1)+a(n-2)] with a(1)=a(2)=1.

1, 1, 2, 5, 29, 408, 33461, 38613965, 3654502875938, 399133058537705128729, 4125636888562548868221559797461449, 4657508918199804645965719872781284840798220312648198320

Offset: 1

Graph
List
Refs
Listen
History
Text
Internal format

Mark Dols, Jul 28 2010

nonn
frac

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).

			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

Cf. A179907, A000129, A051009.

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 *)

a(10) - a(12) from Robert G. Wilson v, Aug 03 2010

cp's OEIS Frontend

A179823 Denominators in the approximation of sqrt(2) satisfying the recurrence: a(n)= [a(n-1)*a(n-2)+2]/[a(n-1)+a(n-2)] with a(1)=a(2)=1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions