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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A040937 Continued fraction for sqrt(969). 1
31, 7, 1, 3, 3, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 7, 62, 7, 1, 3, 3, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 7, 62, 7, 1, 3, 3, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 7, 62, 7, 1, 3, 3, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 7, 62, 7, 1, 3, 3, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 7, 62, 7, 1, 3, 3, 1, 1, 1, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

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, 1).

FORMULA

a(n)=(1/960)*{-3251*(n mod 16)-311*[(n+1) mod 16]+169*[(n+2) mod 16]+49*[(n+3) mod 16]-71*[(n+4) mod 16]+49*[(n+5) mod 16]+49*[(n+6) mod 16]+109*[(n+7) mod 16]-11*[(n+8) mod 16]+49*[(n+9) mod 16]+49*[(n+10) mod 16]+169*[(n+11) mod 16]+49*[(n+12) mod 16]-71*[(n+13) mod 16]+409*[(n+14) mod 16]+3349*[(n+15) mod 16]}-31*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, Jun 03 2009]

MAPLE

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

CROSSREFS

Sequence in context: A191548 A040938 A040939 * A187810 A174129 A305663

Adjacent sequences:  A040934 A040935 A040936 * A040938 A040939 A040940

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 February 22 19:52 EST 2019. Contains 320403 sequences. (Running on oeis4.)