|
%I #31 Dec 26 2023 07:03:36
%S 17,579,19703,670481,22816057,776416419,26420974303,899089542721,
%T 30595465426817,1041144914054499,35429522543279783,
%U 1205644911385567121,41027356509652561897,1396135766239572671619,47509643408655123396943,1616724011660513768167681
%N Numerators of continued fraction convergents to sqrt(290).
%H Vincenzo Librandi, <a href="/A041544/b041544.txt">Table of n, a(n) for n = 0..200</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (34,1).
%F a(n) = 34*a(n-1)+a(n-2) for n>1, a(0)=17, a(1)=579. G.f.: (17+x)/(1-34*x-x^2). [_Philippe Deléham_, Nov 23 2008]
%p numtheory:-cfrac(sqrt(290),30,'convergents'):
%p map(numer,convergents[1..-2]); # _Robert Israel_, Jun 22 2015
%t Numerator[Convergents[Sqrt[290], 30]] (* _Vincenzo Librandi_, Nov 04 2013 *)
%Y Cf. A041545.
%K nonn,cofr,frac,easy
%O 0,1
%A _N. J. A. Sloane_.
%E Additional term from _Colin Barker_, Nov 08 2013
|
