Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #19 Dec 24 2020 21:24:13
%S 1,1,2,2,5,13,38,58,191,655,2374,4462,17519,71063,298810,646846,
%T 2887921,13237457,62332114,150303170,742458253,3748521653,19340144966,
%U 50903810666,273315477775,1495006933759,8327893878134,23599037077934
%N Numerator of c(n) where c(0)=1, c(n+1) = n/c(n) + 1.
%H Roberto Dvornicich, Francesco Veneziano, and Umberto Zannier, <a href="http://arxiv.org/abs/1403.3470">On the integral values of a curious recurrence</a>, arXiv:1403.3470 [math.NT], 2014.
%H <a href="/index/O#Olympiads">Index to sequences related to Olympiads</a>.
%F It seems that log(a(n)) is asymptotic to C*n*Log(n) with C=0.4....
%o (PARI) lista(nn) = {my(x = 1); for (n=0, nn, print1(numerator(x), ", "); x = 1+ n/x;);} \\ _Michel Marcus_, Dec 24 2020
%Y Cf. A072899.
%K easy,frac,nonn
%O 0,3
%A _Benoit Cloitre_, Aug 10 2002
%E a(0)=1 prepended by _Michel Marcus_, Dec 24 2020