login
This site is supported by donations to The OEIS Foundation.

 

Logo


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

Table of n, a(n) for n=1..114.

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: A088568 A317161 A123737 * A247477 A072927 A120086

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 01:32 EST 2018. Contains 317118 sequences. (Running on oeis4.)