This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A113500 #16 Mar 17 2017 22:53:48
%S A113500 32,3042,375131,46137317,5674515856,697919312217,85838400887831,
%T A113500 10557425389890242,1298477484555612931,159702173174950499517,
%U A113500 19642068823034355828656,2415814763060050816424417
%N A113500 Maximum element in the continued fraction for F(5n+3)^5/F(5n+2)^5 where F=A000045 are Fibonacci numbers.
%D A113500 B. Cloitre, On rational sequences yielding continued fractions with unbounded coefficients, in preparation
%H A113500 G. C. Greubel, <a href="/A113500/a113500.txt">Table of n, a(n) for n = 0..475</a>
%F A113500 a(n) = 2*L(10*n+4) + L(10*n+5) + (-1)^n*7 - 1, where L(k) denotes the k-th Lucas number L(k) = F(k-1) + F(k+1), for n >= 0.
%F A113500 Empirical g.f.: (x^4-140*x^3-965*x^2+894*x-32) / ((x-1)*(x+1)*(x^2-123*x+1)). - _Colin Barker_, Jun 17 2013
%t A113500 Table[2*LucasL[10*n + 4] + LucasL[10*n + 5] + 7*(-1)^n - 1, {n,0,50}] (* _G. C. Greubel_, Mar 13 2017 *)
%o A113500 (PARI) a(n)=vecmax(contfrac(fibonacci(5*n+3)^5/fibonacci(5*n+2)^5))
%Y A113500 Cf. A000045.
%K A113500 nonn
%O A113500 0,1
%A A113500 _Benoit Cloitre_, Jan 10 2006