|
%I M1553 #55 Jun 22 2020 06:57:16
%S 2,5,55,9999,3620211523,25838201785967533906,
%T 3408847366605453091140558218322023440765
%N Denominators of greedy Egyptian fraction for e - 2.
%C A greedy Egyptian fraction is also called a Sylvester expansion. - _Robert FERREOL_, May 02 2020
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Vincenzo Librandi, <a href="/A006525/b006525.txt">Table of n, a(n) for n = 1..11</a> [a(11) corrected by _Georg Fischer_, Jun 22 2020]
%H H. P. Robinson, <a href="/A001466/a001466.pdf">Letter to N. J. A. Sloane, Sep 1975</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/EgyptianFraction.html">Egyptian Fraction</a>
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Greedy_algorithm_for_Egyptian_fractions">Greedy algorithm for Egyptian fractions</a>
%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>
%F a(n) = ceiling(1/(e - 2 - Sum_{j=0..n-1} 1/a(j))). - _Jon E. Schoenfield_, Dec 26 2014
%e e - 2 = 1/2 + 1/5 + 1/55 + 1/9999 + ... . - _Jon E. Schoenfield_, Dec 26 2014
%t lst={};k=N[E-2,1000000];Do[s=Ceiling[1/k];AppendTo[lst,s];k=k-1/s,{n,12}];lst (* _Vladimir Joseph Stephan Orlovsky_, Nov 02 2009 *)
%o (PARI) x = exp(1) - 2;
%o f(x, k) = if(k<1, x, f(x, k - 1) - 1/n(x, k));
%o n(x, k) = ceil(1/f(x, k - 1));
%o for(k = 1, 7, print1(n(x, k), ", ")) \\ _Indranil Ghosh_, Mar 27 2017
%Y Cf. A006526, A269993.
%Y Cf. A001466 (similar for Pi-3).
%K nonn,frac
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _Herman P. Robinson_
%E Offset changed to 1 by _Indranil Ghosh_, Mar 27 2017
| 