The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080908 a(n) = the sign of r(n), where r(n) is the integer in [ -2n,2n] which is congruent to (2n)! modulo 4n+1 0
 0, 1, -1, 1, -1, 0, 0, 1, 0, -1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, -1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS If 4n+1 is composite, then a(n)=0, except when n=2. If 4n+1 is a prime number, then (2n)! is a square root of -1 modulo 4n+1 and a(n)=1 or a(n)=-1. Is there a simple way to predict whether a(n)=1 or a(n)=-1 ? The Maple program could be simplified by setting sign(0)=0, but I do not know how to do that. REFERENCES Hardy, G. H. and Wright, E. M., An introduction to the theory of number (Fourth Edition, 1960), section 7.7: the residue of ((p-1)/2)! LINKS EXAMPLE a(2) = -1 because 4! = 24 = -3 modulo 9 and a(5) = 0 because 10! = 0 modulo 21. MAPLE for n from 0 to 100 do (sign(2*mods((2*n)!, 4*n+1)+1) + sign(2*mods((2*n)!, 4*n+1)-1))/2 end do; CROSSREFS Sequence in context: A099859 A176416 A102460 * A131720 A131719 A342460 Adjacent sequences:  A080905 A080906 A080907 * A080909 A080910 A080911 KEYWORD sign AUTHOR Christophe Leuridan (Christophe.Leuridan(AT)ujf-grenoble.fr), Apr 01 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 4 12:43 EDT 2022. Contains 357239 sequences. (Running on oeis4.)