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!)
A110568 Period 6: repeat [1, 0, 2, 2, 0, 1]. 2

%I #31 Dec 14 2023 05:18:12

%S 1,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,

%T 0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,

%U 2,2,0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,2,2,0,1,1,0,2

%N Period 6: repeat [1, 0, 2, 2, 0, 1].

%C Permutation of {0, 1, 2}, followed by its reversal, repeated.

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

%F a(n) = A078008(n) mod 3.

%F G.f.: (1-x+3*x^2-x^3+x^4) / (1-x+x^2-x^3+x^4-x^5).

%F a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5) for n>4.

%F a(n) = 1 + cos(2*Pi*n/3)/2 - sqrt(3)*sin(2*Pi*n/3)/2 - cos(Pi*n/3)/2 + sqrt(3)*sin(Pi*n/3)/6.

%F a(n) = a(n-6) for n > 5. - _Wesley Ivan Hurt_, Jun 28 2016

%F a(n) = ((n-1)*(-1)^(n-1) mod 3). - _Wesley Ivan Hurt_, Jan 07 2021

%p A110568:=n->[1, 0, 2, 2, 0, 1][(n mod 6)+1]: seq(A110568(n), n=0..100); # _Wesley Ivan Hurt_, Jun 28 2016

%t Mod[#,3]&/@CoefficientList[Series[(1-x)/(1-x-2x^2),{x,0,100}],x] (* _Harvey P. Dale_, Mar 30 2011 *)

%t PadRight[{}, 100, {1, 0, 2, 2, 0, 1}] (* _Wesley Ivan Hurt_, Jun 28 2016 *)

%t LinearRecurrence[{1,-1,1,-1,1},{1,0,2,2,0},100] (* _Harvey P. Dale_, Apr 03 2019 *)

%o (Magma) &cat [[1, 0, 2, 2, 0, 1]^^30]; // _Wesley Ivan Hurt_, Jun 28 2016

%o (PARI) x='x+O('x^50); Vec((1-x+3*x^2-x^3+x^4)/(1-x+x^2-x^3+x^4-x^5)) \\ _G. C. Greubel_, Aug 31 2017

%Y Cf. A078008, A088689, A105198, A110549, A110550, A110551, A110569.

%K easy,nonn

%O 0,3

%A _Paul Barry_, Jul 27 2005

%E Name changed by _Wesley Ivan Hurt_, Jun 28 2016

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 August 7 22:54 EDT 2024. Contains 375018 sequences. (Running on oeis4.)