This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A010175 Continued fraction for sqrt(109). 1
 10, 2, 3, 1, 2, 4, 1, 6, 6, 1, 4, 2, 1, 3, 2, 20, 2, 3, 1, 2, 4, 1, 6, 6, 1, 4, 2, 1, 3, 2, 20, 2, 3, 1, 2, 4, 1, 6, 6, 1, 4, 2, 1, 3, 2, 20, 2, 3, 1, 2, 4, 1, 6, 6, 1, 4, 2, 1, 3, 2, 20, 2, 3, 1, 2, 4, 1, 6, 6, 1, 4, 2, 1, 3, 2, 20, 2, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..999 G. Xiao, Contfrac Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1). FORMULA a(n)=(1/1575)*{-1832*(n mod 15)+163*[(n+1) mod 15]-152*[(n+2) mod 15]+163*[(n+3) mod 15]+268*[(n+4) mod 15]-257*[(n+5) mod 15]+583*[(n+6) mod 15]+58*[(n+7) mod 15]-467*[(n+8) mod 15]+373*[(n+9) mod 15]-152*[(n+10) mod 15]-47*[(n+11) mod 15]+268*[(n+12) mod 15]-47*[(n+13) mod 15]+1948*[(n+14) mod 15]}-10*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, Jul 24 2009] MATHEMATICA ContinuedFraction[Sqrt[109], 300] (* Vladimir Joseph Stephan Orlovsky, Mar 11 2011*) PadRight[{10}, 120, {20, 2, 3, 1, 2, 4, 1, 6, 6, 1, 4, 2, 1, 3, 2}] (* Harvey P. Dale, May 29 2016 *) CROSSREFS Sequence in context: A265994 A201278 A232589 * A208091 A160136 A049296 Adjacent sequences:  A010172 A010173 A010174 * A010176 A010177 A010178 KEYWORD nonn,cofr 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.