login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A040452 Continued fraction for sqrt(474). 0

%I

%S 21,1,3,2,1,1,1,6,1,1,1,2,3,1,42,1,3,2,1,1,1,6,1,1,1,2,3,1,42,1,3,2,1,

%T 1,1,6,1,1,1,2,3,1,42,1,3,2,1,1,1,6,1,1,1,2,3,1,42,1,3,2,1,1,1,6,1,1,

%U 1,2,3,1,42,1,3,2,1,1,1,6,1,1,1,2,3,1,42,1,3,2,1,1

%N Continued fraction for sqrt(474).

%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)*{-3665*(n mod 14)+248*[(n+1) mod 14]-25*[(n+2) mod 14]-25*[(n+3) mod 14]+66*[(n+4) mod 14]+66*[(n+5) mod 14]+521*[(n+6) mod 14]-389*[(n+7) mod 14]+66*[(n+8) mod 14]+66*[(n+9) mod 14]+157*[(n+10) mod 14]+157*[(n+11) mod 14]-116*[(n+12) mod 14]+3797*[(n+13) mod 14]}-21*[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava_, May 13 2009]

%p with(numtheory): Digits := 300: convert(evalf(sqrt(474)),confrac);

%K nonn,cofr,easy,less

%O 0,1

%A _N. J. A. Sloane_.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 00:08 EST 2022. Contains 350467 sequences. (Running on oeis4.)