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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152855 Periodic sequence [1,2,0,2,0] of period 5 0
 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0, 1, 2, 0, 2, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,1) FORMULA a(n+5) = a(n) with a(0) = 1, a(1) = a(3) = 2 and a(2) = a(4) = 0 o.g.f f(z) = (1+2*z+2*z^3)/(1-z^5). a(n) = 1+(-1/5*((5-5^(1/2))^(1/2)-(5+5^(1/2))^(1/2))*2^(1/2))*sin(2*n*Pi/5)+(1/5*((5-5^(1/2))^(1/2)+(5+5^(1/2))^(1/2))*2^(1/2))*sin(4*n*Pi/5) a(n)=(1/10)*{3*(n mod 5)+[(n+1) mod 5]+5*[(n+2) mod 5]-5*[(n+3) mod 5]+11*[(n+4) mod 5]}, with n>=0 [From Paolo P. Lava, Dec 15 2008] CROSSREFS Sequence in context: A174793 A245718 A192011 * A218907 A192575 A029401 Adjacent sequences: A152852 A152853 A152854 * A152856 A152857 A152858 KEYWORD easy,nonn AUTHOR Richard Choulet, Dec 14 2008 STATUS approved

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.

Last modified December 3 09:03 EST 2022. Contains 358515 sequences. (Running on oeis4.)