|
%I #40 Dec 27 2023 00:17:33
%S 10,3,2,1,1,1,1,2,3,20,3,2,1,1,1,1,2,3,20,3,2,1,1,1,1,2,3,20,3,2,1,1,
%T 1,1,2,3,20,3,2,1,1,1,1,2,3,20,3,2,1,1,1,1,2,3,20,3,2,1,1,1,1,2,3,20,
%U 3,2,1,1,1,1,2,3,20,3,2,1,1,1,1,2,3,20,3,2
%N Continued fraction for sqrt(106).
%H Vincenzo Librandi, <a href="/A010172/b010172.txt">Table of n, a(n) for n = 0..999</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_09">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 0, 0, 0, 0, 0, 0, 1).
%t ContinuedFraction[Sqrt[106],300] (* _Vladimir Joseph Stephan Orlovsky_, Mar 11 2011 *)
%t PadRight[{10},120,{20,3,2,1,1,1,1,2,3}] (* _Harvey P. Dale_, Aug 19 2021 *)
%o (Python)
%o from sympy import sqrt
%o from sympy.ntheory.continued_fraction import continued_fraction_iterator
%o def aupton(terms):
%o gen = continued_fraction_iterator(sqrt(106))
%o return [next(gen) for i in range(terms)]
%o print(aupton(82)) # _Michael S. Branicky_, Oct 03 2021
%K nonn,cofr
%O 0,1
%A _N. J. A. Sloane_
|
