OFFSET
0,3
REFERENCES
Shallit, Jeffrey; On the worst case of three algorithms for computing the Jacobi symbol. J. Symbolic Comput. 10 (1990), no. 6, 593-610.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..1000
Simon Plouffe, Approximations de s�ries g�n�ratrices et quelques conjectures, Dissertation, Universit� du Qu�bec � Montr�al, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Jeffrey Shallit, On the worst case of three algorithms for computing the Jacobi Symbol, J. Symbolic Comput. 10 (1990), no 6, 593-610, Variable R_n conjecture 6.2.
Index entries for linear recurrences with constant coefficients, signature (5,0,-10,4).
FORMULA
a(n) = 5*a(n-1)-10*a(n-3)+4*a(n-4), by definition [R. J. Mathar, Mar 11 2009]
MAPLE
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.]
MATHEMATICA
LinearRecurrence[{5, 0, -10, 4}, {0, 1, 7, 31}, 30] (* Harvey P. Dale, Apr 11 2021 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Edited by R. J. Mathar, Mar 11 2009
STATUS
approved