%I M2962 #49 Oct 04 2017 00:09:03
%S 1,3,13,253,218201,61323543802,5704059172637470075854,
%T 178059816815203395552917056787722451335939040,
%U 227569456678536847041583520060628448125647436561262746582115170178319521793841532532509636
%N Denominators of greedy Egyptian fraction for square root of 2.
%C Conjecture: Let a(n) = 2^2^(n + b(n)), then b(n) converges to a constant that is about 0.2163... - _Manfred Scheucher_, Aug 17 2015
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Manfred Scheucher, <a href="/A006487/b006487.txt">Table of n, a(n) for n = 0..11</a>
%H Manfred Scheucher, <a href="/A006487/a006487_1.txt">Table of n, a(n) for n = 0..14</a>
%H Manfred Scheucher, <a href="/A006487/a006487.sage.txt">Sage Script</a>.
%H D. S. Kluk and N. J. A. Sloane, <a href="/A002050/a002050_3.pdf">Correspondence, 1979</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/EgyptianFraction.html">Egyptian Fraction</a>.
%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%F a(n) = ceiling(1/(sqrt(2) - Sum_{j=0..n-1} 1/a(j))). - _Jon E. Schoenfield_, Dec 26 2014
%e sqrt(2) = 1 + 1/3 + 1/13 + 1/253 + 1/218201 + ... . - _Jon E. Schoenfield_, Dec 26 2014
%p a[0]:= 1;
%p for n from 1 to 10 do
%p v:= ceil(1/(sqrt(2)-add(1/a[i],i=0..n-1)));
%p while not v::integer do
%p Digits:= 2*Digits;
%p v:= ceil(1/(sqrt(2)-add(1/a[i],i=0..n-1)))
%p od;
%p a[n]:= v;
%p od:
%p seq(a[i],i=0..10); # _Robert Israel_, Aug 17 2015
%t lst={};k=N[Sqrt[2],1000];Do[s=Ceiling[1/k];AppendTo[lst,s];k=k-1/s,{n,12}];lst (* _Vladimir Joseph Stephan Orlovsky_, Nov 02 2009 *)
%K nonn
%O 0,2
%A _N. J. A. Sloane_, _Simon Plouffe_
%E a(8) from _Manfred Scheucher_, Aug 17 2015