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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A111113 a(2^m) = 1, a(2^m+1) = -1 (m>0), otherwise a(n) = 0. 1
0, 0, 1, -1, 1, -1, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

REFERENCES

A. G. Postnikov, Tauberian Theory and Its Applications, Proc. Steklov. Inst. Math., 144 (1979), translated as Issue 2, 1980. See p. 29.

A. Renyi, On a Tauberian theorem of O. Szasz, Acta Univ. Szeged. Sect. Sci. Math., 11 (1946), 119-123.

FORMULA

Euler transform of A079559 is sequence offset -1. - Michael Somos Aug 03 2009

G.f.: (1 - x) * (Sum_{k>0} x^(2^k)). - Michael Somos Aug 03 2009

EXAMPLE

x^2 - x^3 + x^4 - x^5 + x^8 - x^9 + x^16 - x^17 + x^32 - x^33 + ...

PROG

(PARI) {a(n) = if( n<2, 0, [1, -1, 0] [1 + min(2, n - 2^(length(binary(n)) - 1))] )} /* Michael Somos Aug 03 2009 */

(PARI) {a(n) = if( n<2, 0, if( n%2, -a(n - 1), n == 2^valuation(n, 2)))} /* Michael Somos Aug 03 2009 */

CROSSREFS

Sequence in context: A073089 A011657 A072126 * A095190 A131735 A131736

Adjacent sequences:  A111110 A111111 A111112 * A111114 A111115 A111116

KEYWORD

sign

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Oct 15 2005

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:56 EST 2012. Contains 205694 sequences.