login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 0

%I #8 Oct 13 2022 13:36:02

%S 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,

%T 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,

%U 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

%N 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).

%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,-1,1).

%F 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)

%K nonn,easy

%O 1,1

%A _Benoit Cloitre_, Nov 24 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 18:22 EDT 2024. Contains 371750 sequences. (Running on oeis4.)