This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A040248 Continued fraction for sqrt(265). 1

%I

%S 16,3,1,1,2,2,1,1,3,32,3,1,1,2,2,1,1,3,32,3,1,1,2,2,1,1,3,32,3,1,1,2,

%T 2,1,1,3,32,3,1,1,2,2,1,1,3,32,3,1,1,2,2,1,1,3,32,3,1,1,2,2,1,1,3,32,

%U 3,1,1,2,2,1,1,3,32,3,1,1,2,2,1,1,3,32,3,1,1,2,2,1,1

%N Continued fraction for sqrt(265).

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

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

%F a(n)=(1/162)*{-499*(n mod 9)-13*[(n+1) mod 9]+23*[(n+2) mod 9]+41*[(n+3) mod 9]+23*[(n+4) mod 9]+5*[(n+5) mod 9]+23*[(n+6) mod 9]+59*[(n+7) mod 9]+545*[(n+8) mod 9]}-16*[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava_, Apr 21 2009]

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

%t ContinuedFraction[Sqrt[265],100] (* or *) PadRight[{16},100,{32,3,1,1,2,2,1,1,3}] (* _Harvey P. Dale_, Dec 09 2014 *)

%K nonn,cofr,easy

%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 March 23 12:43 EDT 2019. Contains 321430 sequences. (Running on oeis4.)