|
%I #26 Nov 13 2023 07:02:40
%S 6,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,
%T 12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,1,12,
%U 1,12,1,12,1,12,1,12,1,12,1
%N Continued fraction for sqrt(48).
%H Harry J. Smith, <a href="/A040041/b040041.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_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F From _Amiram Eldar_, Nov 12 2023: (Start)
%F Multiplicative with a(2^e) = 12, and a(p^e) = 1 for an odd prime p.
%F Dirichlet g.f.: zeta(s) * (1 + 11/2^s). (End)
%e 6.9282032302755091741097853... = 6 + 1/(1 + 1/(12 + 1/(1 + 1/(12 + ...)))). - _Harry J. Smith_, Jun 06 2009
%p Digits := 100: convert(evalf(sqrt(N)),confrac,90,'cvgts'):
%t ContinuedFraction[Sqrt[48],300] (* _Vladimir Joseph Stephan Orlovsky_, Mar 07 2011 *)
%o (PARI) { allocatemem(932245000); default(realprecision, 24000); x=contfrac(sqrt(48)); for (n=0, 20000, write("b040041.txt", n, " ", x[n+1])); } \\ _Harry J. Smith_, Jun 06 2009
%Y Cf. A010502 (decimal expansion).
%K nonn,cofr,easy,mult
%O 0,1
%A _N. J. A. Sloane_
|
