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 A040059 #22 Dec 27 2023 00:38:17
%S A040059 8,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,
%T A040059 16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,4,16,
%U A040059 4,16,4,16,4,16,4,16,4,16,4
%N A040059 Continued fraction for sqrt(68).
%H A040059 Harry J. Smith, <a href="/A040059/b040059.txt">Table of n, a(n) for n = 0..20000</a>
%H A040059 G. Xiao, <a href="http://wims.unice.fr/~wims/en_tool~number~contfrac.en.html">Contfrac</a>
%H A040059 <a href="/index/Con#confC">Index entries for continued fractions for constants</a>
%H A040059 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0, 1).
%e A040059 8.2462112512353210996428197... = 8 + 1/(4 + 1/(16 + 1/(4 + 1/(16 + ...)))). - _Harry J. Smith_, Jun 08 2009
%p A040059 Digits := 100: convert(evalf(sqrt(N)),confrac,90,'cvgts'):
%t A040059 ContinuedFraction[Sqrt[68],300] (* _Vladimir Joseph Stephan Orlovsky_, Mar 08 2011 *)
%o A040059 (PARI) { allocatemem(932245000); default(realprecision, 37000); x=contfrac(sqrt(68)); for (n=0, 20000, write("b040059.txt", n, " ", x[n+1])); } \\ _Harry J. Smith_, Jun 08 2009
%Y A040059 Cf. A010520 Decimal expansion. - _Harry J. Smith_, Jun 08 2009
%K A040059 nonn,cofr,easy
%O A040059 0,1
%A A040059 _N. J. A. Sloane_