login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A040628 Continued fraction for sqrt(654). 0
25, 1, 1, 2, 1, 9, 1, 1, 16, 1, 1, 9, 1, 2, 1, 1, 50, 1, 1, 2, 1, 9, 1, 1, 16, 1, 1, 9, 1, 2, 1, 1, 50, 1, 1, 2, 1, 9, 1, 1, 16, 1, 1, 9, 1, 2, 1, 1, 50, 1, 1, 2, 1, 9, 1, 1, 16, 1, 1, 9, 1, 2, 1, 1, 50, 1, 1, 2, 1, 9, 1, 1, 16, 1, 1, 9, 1, 2, 1, 1, 50, 1, 1, 2, 1, 9, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

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

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)*{-2891*(n mod 16)+49*[(n+1) mod 16]+109*[(n+2) mod 16]-11*[(n+3) mod 16]+529*[(n+4) mod 16]-431*[(n+5) mod 16]+49*[(n+6) mod 16]+949*[(n+7) mod 16]-851*[(n+8) mod 16]+49*[(n+9) mod 16]+529*[(n+10) mod 16]-431*[(n+11) mod 16]+109*[(n+12) mod 16]-11*[(n+13) mod 16]+49*[(n+14) mod 16]+2989*[(n+15) mod 16]}-25*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, May 15 2009]

MAPLE

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

MATHEMATICA

ContinuedFraction[Sqrt[654], 100] (* or *) PadRight[{25}, 100, {50, 1, 1, 2, 1, 9, 1, 1, 16, 1, 1, 9, 1, 2, 1, 1}] (* Harvey P. Dale, May 15 2015 *)

CROSSREFS

Sequence in context: A040630 A040631 A040632 * A040629 A040627 A040626

Adjacent sequences:  A040625 A040626 A040627 * A040629 A040630 A040631

KEYWORD

nonn,cofr,easy,less

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 2 16:36 EDT 2022. Contains 355029 sequences. (Running on oeis4.)