This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112053 a(n) = A112046(2n) - A112046(2n-1) = A112048(n) - A112047(n). 6
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, -2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, -6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,12 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A112048(n)-A112047(n). MATHEMATICA a112046[n_]:=Block[{i=1}, While[JacobiSymbol[i, 2n + 1]==1, i++]; i]; Table[a112046[2n] - a112046[2n - 1] , {n, 101}] (* Indranil Ghosh, May 24 2017 *) PROG (Python) from sympy import jacobi_symbol as J def a112046(n):     i=1     while True:         if J(i, 2*n + 1)!=1: return i         else: i+=1 def a(n): return a112046(2*n) - a112046(2*n - 1) print [a(n) for n in xrange(1, 102)] # Indranil Ghosh, May 24 2017 CROSSREFS Cf. A112046, A112047, A112048. Indices where a(n) is not zero: A112054. Values at those points: A112059. Sequence in context: A117370 A260943 A151756 * A089798 A070536 A030201 Adjacent sequences:  A112050 A112051 A112052 * A112054 A112055 A112056 KEYWORD sign AUTHOR Antti Karttunen, Aug 27 2005 STATUS approved

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