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 #33 Mar 19 2018 04:07:00
%S 1,1,4,25,1681,5317636,66314914699609,8947678119828215014722891025,
%T 178098260698995011212395018312912894502905113202338936836
%N The numerators of the convergents to the recursion x=1/(x^2+1).
%C The recursion converges to the real root of 1/(x^2+1) - x = 0, 0.682327803...
%C An interesting consequence of this result occurs if we multiply by x^2+1 to get 1-x-x^3=0. These different equations intersect at the same root 0.682327803... Note also that a(n) is a square. The square roots form sequence A076725.
%C a(n) is the number of (0,1)-labeled perfect binary trees of height n such that no adjacent nodes have 1 as the label and the root is labeled 0. - _Ran Pan_, May 22 2015
%H Ran Pan, <a href="http://www.math.ucsd.edu/~projectp/warmups/eR.html">Exercise R</a>, Project P.
%F a(n+2) = (a(n)^2 + a(n+1))^2. - _Ran Pan_, May 22 2015
%F a(n) ~ c * d^(2^n), where c = A088559 = 0.465571231876768... is the root of the equation c*(1+c)^2 = 1, d = 1.6634583970724267140029... . - _Vaclav Kotesovec_, May 22 2015
%t f[n_]:=(n+1/n)/n;Prepend[Denominator[NestList[f,2,7]],1] (* _Vladimir Joseph Stephan Orlovsky_, Nov 19 2010 *)
%t RecurrenceTable[{a[n]==(a[n-2]^2 + a[n-1])^2, a[0]==1, a[1]==1},a,{n,0,10}] (* _Vaclav Kotesovec_, May 22 2015 after _Ran Pan_ *)
%o (PARI) x=0;for(j=1,10,x=1/(x^2+1);print1((numerator(x))","))
%Y Cf. A076725, A088559.
%K frac,nonn
%O 0,3
%A _Cino Hilliard_, Sep 15 2008