login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A040225 Continued fraction for sqrt(241). 0
15, 1, 1, 9, 1, 5, 3, 3, 1, 1, 3, 3, 5, 1, 9, 1, 1, 30, 1, 1, 9, 1, 5, 3, 3, 1, 1, 3, 3, 5, 1, 9, 1, 1, 30, 1, 1, 9, 1, 5, 3, 3, 1, 1, 3, 3, 5, 1, 9, 1, 1, 30, 1, 1, 9, 1, 5, 3, 3, 1, 1, 3, 3, 5, 1, 9, 1, 1, 30, 1, 1, 9, 1, 5, 3, 3, 1, 1, 3, 3, 5, 1, 9, 1, 1, 30, 1, 1, 9, 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, 0, 1).

FORMULA

a(n)=(1/1156)*{-1933*(n mod 17)+39*[(n+1) mod 17]+583*[(n+2) mod 17]-505*[(n+3) mod 17]+311*[(n+4) mod 17]-97*[(n+5) mod 17]+39*[(n+6) mod 17]-97*[(n+7) mod 17]+39*[(n+8) mod 17]+175*[(n+9) mod 17]+39*[(n+10) mod 17]+175*[(n+11) mod 17]-233*[(n+12) mod 17]+583*[(n+13) mod 17]-505*[(n+14) mod 17]+39*[(n+15) mod 17]+2011*[(n+16) mod 17]}-15*[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava, Apr 23 2009]

MAPLE

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

CROSSREFS

Sequence in context: A040227 A040226 A172429 * A070644 A174389 A176286

Adjacent sequences:  A040222 A040223 A040224 * A040226 A040227 A040228

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 October 28 04:43 EDT 2021. Contains 348313 sequences. (Running on oeis4.)