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

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010133 Continued fraction for sqrt(41). 2

%I #27 Aug 03 2024 17:09:51

%S 6,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,

%T 12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,2,12,2,

%U 2,12,2,2,12,2,2,12,2,2,12

%N Continued fraction for sqrt(41).

%H Harry J. Smith, <a href="/A010133/b010133.txt">Table of n, a(n) for n = 0..20000</a>

%H G. Xiao, <a href="http://wims.unice.fr/~wims/en_tool~number~contfrac.en.html">Contfrac</a>

%H <a href="/index/Con#confC">Index entries for continued fractions for constants</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1).

%F From _Elmo R. Oliveira_, Aug 03 2024: (Start)

%F G.f.: 2*(3 + x + x^2 + 3*x^3)/((1 - x)*(1 + x + x^2)).

%F a(n) = a(n-3), n > 3. (End)

%e 6.40312423743284868648821767... = 6 + 1/(2 + 1/(2 + 1/(12 + 1/(2 + ...)))). - _Harry J. Smith_, Jun 05 2009

%t ContinuedFraction[Sqrt[41],300] (* _Vladimir Joseph Stephan Orlovsky_, Mar 06 2011 *)

%o (PARI) { allocatemem(932245000); default(realprecision, 25000); x=contfrac(sqrt(41)); for (n=0, 20000, write("b010133.txt", n, " ", x[n+1])); } \\ _Harry J. Smith_, Jun 05 2009

%Y Cf. A010495 Decimal expansion. - _Harry J. Smith_, Jun 05 2009

%Y Cf. A041068/A041069 (convergents), A248267 (Egyptian fraction).

%K nonn,cofr,easy

%O 0,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 19 11:06 EDT 2024. Contains 376010 sequences. (Running on oeis4.)