[(-1)^n*a(n)] = [1, 0, 1, -2, 4, -8, 16, -32, ...] is the inverse binomial transform of A008619 = [1, 1, 2, 2, 3, 3, 4, 4, 5, 5, ...]. - Philippe Deléham, Nov 15 2009
Number of compositions (ordered partitions) of n into an even number of parts. - Geoffrey Critzer, Mar 28 2010
Number of compositions of n into an even number of even parts.
Number of compositions of n into parts k >= 2 where there are k - 1 sorts of part k. - Joerg Arndt, Sep 30 2012
Taking n-th differences of this sequence reproduces the same sequence except for a(1) = n mod 2 (parity of n) and a(0) = (-1)^a(1)*floor(n/2 + 1). - M. F. Hasler, Jan 13 2015
REFERENCES
Richard P. Stanley, Enumerative Combinatorics, Vol. I, Cambridge University Press, 1997, p. 45, exercise 9.