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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A040295 Continued fraction for sqrt(313). 0
17, 1, 2, 4, 11, 1, 1, 3, 2, 2, 3, 1, 1, 11, 4, 2, 1, 34, 1, 2, 4, 11, 1, 1, 3, 2, 2, 3, 1, 1, 11, 4, 2, 1, 34, 1, 2, 4, 11, 1, 1, 3, 2, 2, 3, 1, 1, 11, 4, 2, 1, 34, 1, 2, 4, 11, 1, 1, 3, 2, 2, 3, 1, 1, 11, 4, 2, 1, 34, 1, 2, 4, 11, 1, 1, 3, 2, 2, 3, 1, 1, 11, 4, 2, 1, 34 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..85.

Index entries for continued fractions for constants

Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

FORMULA

a(n)=(1/578)*{-1101*(n mod 17)+55*[(n+1) mod 17]+89*[(n+2) mod 17]+259*[(n+3) mod 17]-319*[(n+4) mod 17]+21*[(n+5) mod 17]+89*[(n+6) mod 17]-13*[(n+7) mod 17]+21*[(n+8) mod 17]+55*[(n+9) mod 17]-47*[(n+10) mod 17]+21*[(n+11) mod 17]+361*[(n+12) mod 17]-217*[(n+13) mod 17]-47*[(n+14) mod 17]-13*[(n+15) mod 17]+1143*[(n+16) mod 17]}-17*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, Apr 27 2009]

MAPLE

with(numtheory): Digits := 300: convert(evalf(sqrt(313)), confrac);

MATHEMATICA

ContinuedFraction[Sqrt[313], 120] (* or *) PadRight[{17}, 120, {34, 1, 2, 4, 11, 1, 1, 3, 2, 2, 3, 1, 1, 11, 4, 2, 1}] (* Harvey P. Dale, Feb 25 2015 *)

CROSSREFS

Sequence in context: A040296 A040297 A239866 * A040298 A040300 A040299

Adjacent sequences:  A040292 A040293 A040294 * A040296 A040297 A040298

KEYWORD

nonn,cofr,easy

AUTHOR

N. J. A. Sloane.

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 21 04:59 EDT 2019. Contains 321364 sequences. (Running on oeis4.)