The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A083037 a(n)=2*A083036(n)-n. Also -A123737(n). 7
 1, 0, -1, 0, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 2, 3, 2, 1, 2, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, 1, 0, 1, 2, 1, 0, 1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0, -1, 0, 1, 0, -1, 0, -1, -2, -1, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS Kevin O'Bryant, Bruce Reznick and Monika Serbinowska, Almost alternating sums, Amer. Math. Monthly, Vol. 113 (October 2006), pp. 673-688. FORMULA O'Bryant, Reznick, & Serbinowska show that |a(n)| <= k log n + 1, with k = 1/(2 log (1 + sqrt(2))), and further a(n) > k log n + 0.78 infinitely often. - Charles R Greathouse IV, Feb 07 2013 PROG (PARI) a(n)=-sum(i=1, n, (-1)^sqrtint(2*i^2)) \\ Charles R Greathouse IV, Feb 07 2013 CROSSREFS Cf. A083035, A083036, A083038, A123737. Sequence in context: A307198 A307196 A123737 * A247477 A072927 A307194 Adjacent sequences:  A083034 A083035 A083036 * A083038 A083039 A083040 KEYWORD sign AUTHOR Benoit Cloitre, Apr 17 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 15 10:27 EDT 2021. Contains 342977 sequences. (Running on oeis4.)