|
%I M3961 #34 Apr 13 2022 13:25:17
%S 1,5,31,141,659,3005,13739,62669,285931,1304285,5949691,27139821,
%T 123799979,564720125,2576001179,11750565389,53600825611,244502996765,
%U 1115313334651,5087560678701,23207176728299,105860762282045,482889457961819,2202725765240909
%N Worst case of a Jacobi symbol algorithm.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Simon Plouffe, <a href="https://arxiv.org/abs/0911.4975">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
%H Simon Plouffe, <a href="/A000051/a000051_2.pdf">1031 Generating Functions</a>, Appendix to Thesis, Montreal, 1992
%H J. Shallit, <a href="http://dx.doi.org/10.1016/S0747-7171(08)80160-5">On the worst case of three algorithms for computing the Jacobi symbol</a>, J. Symbolic Comput. 10 (1990), no. 6, 593-610, Variable S_n conjecture 6.2.
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (5, 0, -10, 4).
%F a(n) = 5*a(n-1) - 10a(n-3) + 4a(n-4) by definition [_R. J. Mathar_, Mar 11 2009]
%p A005826:=(-1-6*z**2+4*z**3)/(2*z**2-1)/(1-5*z+2*z**2); [Conjectured (correctly) by _Simon Plouffe_ in his 1992 dissertation.]
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_, _Jeffrey Shallit_
%E More terms from _L. Edson Jeffery_, Dec 07 2013
|
