|
%I
%S 20,6,1,2,4,7,1,4,1,7,4,2,1,6,40,6,1,2,4,7,1,4,1,7,4,2,1,6,40,6,1,2,4,
%T 7,1,4,1,7,4,2,1,6,40,6,1,2,4,7,1,4,1,7,4,2,1,6,40,6,1,2,4,7,1,4,1,7,
%U 4,2,1,6,40,6,1,2,4,7,1,4,1,7,4,2,1,6,40,6,1,2,4,7
%N Continued fraction for sqrt(406).
%H <a href="/index/Con#confC">Index entries for continued fractions for constants</a>
%H <a href="/index/Rec#order_14">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
%F a(n)=(1/1274)*{-1208*(n mod 14)-389*[(n+1) mod 14]+157*[(n+2) mod 14]+248*[(n+3) mod 14]+339*[(n+4) mod 14]-480*[(n+5) mod 14]+339*[(n+6) mod 14]-207*[(n+7) mod 14]+612*[(n+8) mod 14]-207*[(n+9) mod 14]-116*[(n+10) mod 14]-25*[(n+11) mod 14]+521*[(n+12) mod 14]+1340*[(n+13) mod 14]}-20*[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava_, Apr 30 2009]
%p with(numtheory): Digits := 300: convert(evalf(sqrt(406)),confrac);
%K nonn,cofr,easy
%O 0,1
%A _N. J. A. Sloane_.
|
