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

 

Logo

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!)
A152857 Period 5: repeat [0, 2, 3, 0, 0]. 1
0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0, 0, 2, 3, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..69.

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

FORMULA

a(n+5) = a(n) with a(0) = a(3) = a(4) = 0, a(1) = 2 and a(2) = 3.

O.g.f f(z) = (2*z+3*z^2)/(1-z^5).

a(n) = 1+(-1/2-1/10*5^(1/2))*cos(2*n*Pi/5)+(1/10*(3*(5-5^(1/2))^(1/2)+2*(5+5^(1/2))^(1/2))*2^(1/2))*sin(2*n*Pi/5)+(1/10*5^(1/2)-1/2)*cos(4*n*Pi/5)+(1/10*(2*(5-5^(1/2))^(1/2)-3*(5+5^(1/2))^(1/2))*2^(1/2))*sin(4*n*Pi/5).

a(n) = (1/10)*{(n mod 5)+[(n+1) mod 5]+7*[(n+2) mod 5]-[(n+3) mod 5]-3*[(n+4) mod 5]}, with n>=0. [Paolo P. Lava, Dec 15 2008]

a(n) = (5 + 4*cos(2*(n-1)*Pi/5) + 4*cos(4*(n-1)*Pi/5) + 6*cos(2*(n+3)*Pi/5) + 6*cos(4*(n+3)*Pi/5))/5. - Wesley Ivan Hurt, Jun 25 2022

MATHEMATICA

PadRight[{}, 100, {0, 2, 3, 0, 0}] (* Harvey P. Dale, Aug 09 2021 *)

CROSSREFS

Cf. A026045.

Sequence in context: A048735 A102037 A286530 * A097946 A083926 A218757

Adjacent sequences: A152854 A152855 A152856 * A152858 A152859 A152860

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.

License Agreements, Terms of Use, Privacy Policy. .

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