This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A040524 Continued fraction for sqrt(548). 0
 23, 2, 2, 3, 1, 5, 1, 10, 1, 5, 1, 3, 2, 2, 46, 2, 2, 3, 1, 5, 1, 10, 1, 5, 1, 3, 2, 2, 46, 2, 2, 3, 1, 5, 1, 10, 1, 5, 1, 3, 2, 2, 46, 2, 2, 3, 1, 5, 1, 10, 1, 5, 1, 3, 2, 2, 46, 2, 2, 3, 1, 5, 1, 10, 1, 5, 1, 3, 2, 2, 46, 2, 2, 3, 1, 5, 1, 10, 1, 5, 1, 3, 2, 2, 46, 2, 2 (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, 0, 0, 0, 1). FORMULA a(n)=(1/182)*{-560*(n mod 14)+12*[(n+1) mod 14]+25*[(n+2) mod 14]-14*[(n+3) mod 14]+64*[(n+4) mod 14]-40*[(n+5) mod 14]+129*[(n+6) mod 14]-105*[(n+7) mod 14]+64*[(n+8) mod 14]-40*[(n+9) mod 14]+38*[(n+10) mod 14]-[(n+11) mod 14]+12*[(n+12) mod 14]+584*[(n+13) mod 14]}-23*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, May 14 2009] MAPLE with(numtheory): Digits := 300: convert(evalf(sqrt(548)), confrac); CROSSREFS Sequence in context: A040523 A040522 A040521 * A306374 A253253 A225003 Adjacent sequences:  A040521 A040522 A040523 * A040525 A040526 A040527 KEYWORD nonn,cofr,easy,less 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 13 06:26 EST 2019. Contains 329968 sequences. (Running on oeis4.)