OFFSET
0,1
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (0,-1).
FORMULA
Euler transform of length 6 sequence [ -1, 0, 1, 1, 0, -1].
G.f. A(x) satisfies 0 = f(A(x), A(x^2)) where f(u, v) = (2 - v) - u * (2 - u) * (3 - 2*v).
a(2*n) = 0 unless n=0, a(4*n + 1) = -1, a(4*n + 3) = a(0) = 1.
a(-n) = -a(n) unless n=0. a(n+4) = a(n) unless n=0 or n=-4.
Convolution inverse of A163806.
G.f.: (1 - x + x^2) / (1 + x^2).
G.f. A(x) = 1 - x / (1 + x^2) = 1 / (1 + x / (1 - x / (1 + x / (1 - x)))). - Michael Somos, Jan 03 2013
E.g.f.: 1 - sin(x). - Stefano Spezia, Nov 16 2024
EXAMPLE
G.f. = 1 - x + x^3 - x^5 + x^7 - x^9 + x^11 - x^13 + x^15 - x^17 + x^19 + ...
MATHEMATICA
a[ n_] := Boole[n == 0] + {-1, 0, 1, 0}[[Mod[n, 4, 1]]]; (* Michael Somos, Sep 06 2015 *)
PROG
(PARI) {a(n) = (n==0) + [0, -1, 0, 1][n%4 + 1]};
(PARI) {a(n) = (n==0) - kronecker(-4, n)};
CROSSREFS
KEYWORD
sign,easy,changed
AUTHOR
Michael Somos, Aug 04 2009
STATUS
approved