%I
%S 30,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,
%T 30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,
%U 60,30,60,30,60,30,60,30,60,30,60,30,60,30,60,30,60
%N Continued fraction for sqrt(902).
%H <a href="/index/Con#confC">Index entries for continued fractions for constants</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0, 1).
%F a(n)=45+15*(1)^n30*[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava_, May 29 2009]
%p with(numtheory): Digits := 300: convert(evalf(sqrt(902)),confrac);
%K nonn,cofr,easy
%O 0,1
%A _N. J. A. Sloane_.
