This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A010133 #32 Jul 27 2025 04:19:34
%S A010133 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 A010133 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 A010133 2,12,2,2,12,2,2,12,2,2,12
%N A010133 Continued fraction for sqrt(41).
%D A010133 James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 276.
%H A010133 Harry J. Smith, <a href="/A010133/b010133.txt">Table of n, a(n) for n = 0..20000</a>
%H A010133 G. Xiao, <a href="http://wims.unice.fr/~wims/en_tool~number~contfrac.en.html">Contfrac</a>
%H A010133 <a href="/index/Con#confC">Index entries for continued fractions for constants</a>
%H A010133 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1).
%F A010133 From _Elmo R. Oliveira_, Aug 03 2024: (Start)
%F A010133 G.f.: 2*(3 + x + x^2 + 3*x^3)/((1 - x)*(1 + x + x^2)).
%F A010133 a(n) = a(n-3), n > 3. (End)
%e A010133 6.40312423743284868648821767... = 6 + 1/(2 + 1/(2 + 1/(12 + 1/(2 + ...)))). - _Harry J. Smith_, Jun 05 2009
%t A010133 ContinuedFraction[Sqrt[41],300] (* _Vladimir Joseph Stephan Orlovsky_, Mar 06 2011 *)
%o A010133 (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 A010133 Cf. A010495 (decimal expansion).
%Y A010133 Cf. A041068/A041069 (convergents), A248267 (Egyptian fraction).
%K A010133 nonn,cofr,easy
%O A010133 0,1
%A A010133 _N. J. A. Sloane_