The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A040217 Continued fraction for sqrt(233). 2
 15, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 30, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 30, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 30, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 30, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 30, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 30, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 30, 3, 1, 3, 1, 1, 1, 1, 3, 1, 3, 30, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). FORMULA a(n)=(1/605)*{-1437*(n mod )-62*[(n+1) mod 11]+158*[(n+2) mod 11]-62*[(n+3) mod 11]+48*[(n+4) mod 11]+48*[(n+5) mod 11]+48*[(n+6) mod 11]+158*[(n+7) mod 11]-62*[(n+8) mod 11]+158*[(n+9) mod 11]+1533*[(n+10) mod 11]}-15*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, Apr 23 2009] MAPLE with(numtheory): Digits := 300: convert(evalf(sqrt(233)), confrac); CROSSREFS Sequence in context: A220376 A040224 A237649 * A040218 A226379 A037924 Adjacent sequences:  A040214 A040215 A040216 * A040218 A040219 A040220 KEYWORD nonn,cofr,easy AUTHOR STATUS approved

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 December 2 04:43 EST 2021. Contains 349437 sequences. (Running on oeis4.)