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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A040356 Continued fraction for sqrt(376). 0
19, 2, 1, 1, 3, 1, 2, 2, 4, 2, 2, 1, 3, 1, 1, 2, 38, 2, 1, 1, 3, 1, 2, 2, 4, 2, 2, 1, 3, 1, 1, 2, 38, 2, 1, 1, 3, 1, 2, 2, 4, 2, 2, 1, 3, 1, 1, 2, 38, 2, 1, 1, 3, 1, 2, 2, 4, 2, 2, 1, 3, 1, 1, 2, 38, 2, 1, 1, 3, 1, 2, 2, 4, 2, 2, 1, 3, 1, 1, 2, 38, 2, 1, 1, 3, 1, 2, 2, 4, 2 (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/320)*{-709*(n mod 16)-9*[(n+1) mod 16]+11*[(n+2) mod 16]+51*[(n+3) mod 16]-29*[(n+4) mod 16]+31*[(n+5) mod 16]+11*[(n+6) mod 16]+51*[(n+7) mod 16]-29*[(n+8) mod 16]+11*[(n+9) mod 16]-9*[(n+10) mod 16]+51*[(n+11) mod 16]-29*[(n+12) mod 16]+11*[(n+13) mod 16]+31*[(n+14) mod 16]+731*[(n+15) mod 16]}-19*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, Apr 28 2009]

MAPLE

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

MATHEMATICA

ContinuedFraction[Sqrt[376], 120] (* or *) PadRight[{19}, 120, {38, 2, 1, 1, 3, 1, 2, 2, 4, 2, 2, 1, 3, 1, 1, 2}] (* Harvey P. Dale, Mar 19 2016 *)

CROSSREFS

Sequence in context: A018939 A262028 A326475 * A040355 A166032 A040354

Adjacent sequences:  A040353 A040354 A040355 * A040357 A040358 A040359

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 November 19 22:34 EST 2019. Contains 329323 sequences. (Running on oeis4.)