A076447 Let v(1)=v(2)=v(3)=1, v(n)=(-1)^n*sign(v(n-1)-v(n-2))*v(n-3), then a(n) =1+v(n).

2, 2, 2, 1, 2, 2, 1, 0, 2, 1, 0, 0, 1, 0, 0, 1, 2, 0, 1, 2, 2, 1, 2, 2, 1, 0, 2, 1, 0, 0, 1, 0, 0, 1, 2, 0, 1, 2, 2, 1, 2, 2, 1, 0, 2, 1, 0, 0, 1, 0, 0, 1, 2, 0, 1, 2, 2, 1, 2, 2, 1, 0, 2, 1, 0, 0, 1, 0, 0, 1, 2, 0, 1, 2, 2, 1, 2, 2, 1, 0, 2, 1, 0, 0, 1, 0, 0, 1, 2, 0, 1, 2, 2, 1, 2, 2, 1, 0, 2, 1, 0, 0, 1, 0, 0

Offset

1,1

Links

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

Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,-1,1).

Formula

a(n) is a period-8 sequence with period (1, 0, 2, 1, 0, 0, 1, 0, 0, 1, 2, 0, 1, 2, 2, 1, 2, 2)

Crossrefs

Sequence in context: A368148 A238421 A105154 * A136690 A144703 A276825

Adjacent sequences: A076444 A076445 A076446 * A076448 A076449 A076450

Keyword

nonn,easy

Author

Benoit Cloitre, Nov 24 2002

Status

approved