reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Kevin O'Bryant, Bruce Reznick and Monika Serbinowska, <a href="http://www.math.uiuc.edu/~reznick/ors.pdf">Almost alternating sums</a>, Amer. Math. Monthly, Vol. 113 (October 2006), pp. 673-688.
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
(PARI) a(n)=-sum(i=1, n, (-1)^sqrtint(2*i^2)) \\ Charles R Greathouse IV, Feb 07 2013
approved
editing
_Benoit Cloitre (benoit7848c(AT)orange.fr), _, Apr 17 2003
sign,new
sign
Benoit Cloitre (abmtbenoit7848c(AT)wanadooorange.fr), Apr 17 2003
sign,new
sign
Benoit Cloitre (abcloitreabmt(AT)modulonetwanadoo.fr), Apr 17 2003
sign,new
sign
Benoit Cloitre (abcloitre(AT)wanadoomodulonet.fr), Apr 17 2003
a(n)=2*A083036(n)-n.
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
1,8
sign
Benoit Cloitre (abcloitre(AT)wanadoo.fr), Apr 17 2003
approved