login
This site is supported by donations to The OEIS Foundation.

 

Logo


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

%I

%S 15,1,3,1,1,5,1,3,10,3,1,5,1,1,3,1,30,1,3,1,1,5,1,3,10,3,1,5,1,1,3,1,

%T 30,1,3,1,1,5,1,3,10,3,1,5,1,1,3,1,30,1,3,1,1,5,1,3,10,3,1,5,1,1,3,1,

%U 30,1,3,1,1,5,1,3,10,3,1,5,1,1,3,1,30,1,3,1,1,5,1,3

%N Continued fraction for sqrt(249).

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

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

%F a(n)=(1/192)*{-341*(n mod 16)+31*[(n+1) mod 16]-17*[(n+2) mod 16]+7*[(n+3) mod 16]+55*[(n+4) mod 16]-41*[(n+5) mod 16]+31*[(n+6) mod 16]+91*[(n+7) mod 16]-77*[(n+8) mod 16]-17*[(n+9) mod 16]+55*[(n+10) mod 16]-41*[(n+11) mod 16]+7*[(n+12) mod 16]+31*[(n+13) mod 16]-17*[(n+14) mod 16]+355*[(n+15) mod 16]}-15*[C(2*n,n) mod 2], with n>=0 [From _Paolo P. Lava_, Apr 22 2009]

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

%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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 23 10:55 EDT 2019. Contains 321424 sequences. (Running on oeis4.)