%I M4404 #26 Apr 13 2022 13:25:17
%S 0,1,7,31,145,659,3013,13739,62685,285931,1304317,5949691,27139885,
%T 123799979,564720253,2576001179,11750565645,53600825611,244502997277,
%U 1115313334651,5087560679725,23207176728299,105860762284093,482889457961819,2202725765245005
%N Numerators in a worst case of a Jacobi symbol algorithm.
%D Shallit, Jeffrey; On the worst case of three algorithms for computing the Jacobi symbol. J. Symbolic Comput. 10 (1990), no. 6, 593-610.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Harvey P. Dale, <a href="/A005825/b005825.txt">Table of n, a(n) for n = 0..1000</a>
%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 Jeffrey 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 R_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)-10*a(n-3)+4*a(n-4), by definition [_R. J. Mathar_, Mar 11 2009]
%p A005825:=z*(-1-2*z+4*z**2)/(2*z**2-1)/(1-5*z+2*z**2); [Conjectured (correctly) by _Simon Plouffe_ in his 1992 dissertation.]
%t LinearRecurrence[{5,0,-10,4},{0,1,7,31},30] (* _Harvey P. Dale_, Apr 11 2021 *)
%K nonn
%O 0,3
%A _N. J. A. Sloane_, _Jeffrey Shallit_
%E Edited by R. J. Mathar, Mar 11 2009