|
%I
%S 19,7,1,1,1,2,12,2,1,1,1,7,38,7,1,1,1,2,12,2,1,1,1,7,38,7,1,1,1,2,12,
%T 2,1,1,1,7,38,7,1,1,1,2,12,2,1,1,1,7,38,7,1,1,1,2,12,2,1,1,1,7,38,7,1,
%U 1,1,2,12,2,1,1,1,7,38,7,1,1,1,2,12,2,1,1,1,7,38,7,1
%N Continued fraction for sqrt(366).
%H <a href="/index/Con#confC">Index entries for continued fractions for constants</a>
%H <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F a(n)=(1/396)*{-493*(n mod 12)-161*[(n+1) mod 12]+37*[(n+2) mod 12]+37*[(n+3) mod 12]+70*[(n+4) mod 12]+367*[(n+5) mod 12]-293*[(n+6) mod 12]+4*[(n+7) mod 12]+37*[(n+8) mod 12]+37*[(n+9) mod 12]+235*[(n+10) mod 12]+1060*[(n+11) mod 12]}-19*[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava_, Apr 28 2009]
%p with(numtheory): Digits := 300: convert(evalf(sqrt(366)),confrac);
%t ContinuedFraction[Sqrt[366],100] (* _Harvey P. Dale_, Oct 18 2013 *)
%K nonn,cofr,easy
%O 0,1
%A _N. J. A. Sloane_.
|
