login
A143432
Ultimately period 4 sequence [ 2, 2, 0, 0, ...] with a(0) = a(1) = 1.
2
1, 1, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2, 2, 0, 0, 2
OFFSET
0,5
FORMULA
Euler transform of length 8 sequence [ 1, -1, 0, 2, 0, 0, 0, -1].
a(4*n + 2) = a(4*n + 3) = 0. a(4*n) = a(4*n + 1) = 2 unless n < 1.
G.f.: (1 + x^4) / ((1 - x) * (1 + x^2)).
a(n) = ((n+2) mod 4) - (n mod 2) - floor(3/(n+2)). - Wesley Ivan Hurt, Jun 30 2013
MATHEMATICA
PadRight[{1, 1}, 120, {2, 2, 0, 0}] (* Harvey P. Dale, Feb 13 2016 *)
PROG
(PARI) {a(n) = if(n<0, 0, n = n\2; if( n%2, 0, (n>1)+1 ))}
CROSSREFS
Convolution inverse of A143431.
Sequence in context: A357069 A379857 A033461 * A137677 A015818 A225869
KEYWORD
nonn,easy
AUTHOR
Michael Somos, Aug 14 2008, Sep 18 2008
STATUS
approved