|
%I #22 Dec 27 2023 00:55:20
%S 24,3,2,4,2,3,48,3,2,4,2,3,48,3,2,4,2,3,48,3,2,4,2,3,48,3,2,4,2,3,48,
%T 3,2,4,2,3,48,3,2,4,2,3,48,3,2,4,2,3,48,3,2,4,2,3,48,3,2,4,2,3,48,3,2,
%U 4,2,3,48,3,2,4,2,3,48,3,2,4,2,3,48,3,2,4,2,3,48,3,2
%N Continued fraction for sqrt(590).
%H Matthew House, <a href="/A040565/b040565.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Con#confC">Index entries for continued fractions for constants</a>
%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,1).
%F From _Matthew House_, Feb 11 2017: (Start)
%F G.f.: (24+3*x+2*x^2+4*x^3+2*x^4+3*x^5+24*x^6)/(1-x^6).
%F a(n) = a(n-6). (End)
%p with(numtheory): Digits := 300: convert(evalf(sqrt(590)),confrac);
%t ContinuedFraction[Sqrt[590],90] (* _Harvey P. Dale_, Dec 11 2011 *)
%o (PARI) contfrac(sqrt(590)) \\ _Michel Marcus_, Feb 11 2017
%K nonn,cofr,easy,less
%O 0,1
%A _N. J. A. Sloane_.
|
