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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A040453 Continued fraction for sqrt(475). 2

%I

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

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

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

%N Continued fraction for sqrt(475).

%H <a href="/index/Con#confC">Index entries for continued fractions for constants</a>

%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

%F a(n)=(1/150)*{-593*(n mod 10)+52*[(n+1) mod 10]-8*[(n+2) mod 10]+97*[(n+3) mod 10]-38*[(n+4) mod 10]+82*[(n+5) mod 10]-53*[(n+6) mod 10]+52*[(n+7) mod 10]-8*[(n+8) mod 10]+637*[(n+9) mod 10]}-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(475)),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.

Last modified January 28 04:08 EST 2022. Contains 350654 sequences. (Running on oeis4.)