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!)
A156283 Period 6: repeat [1, 2, 4, -4, -2, -1]. 2
1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2, 4, -4, -2, -1, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) == A141425(n) (mod 9). - Paul Curtz, Feb 08 2009
a(n) = ( (2*A141425(n)) mod 9) - A141425(n). - Paul Curtz, Feb 08 2009
G.f.: (1+x^4+3*x^3+7*x^2+3*x)/( (x+1)*(x^2-x+1)*(x^2+x+1) ). [Maksym Voznyy (voznyy(AT)mail.ru), Aug 11 2009]
From Wesley Ivan Hurt, Jun 23 2016: (Start)
a(n) + a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) = 0 for n>4.
a(n) = cos(n*Pi) + 2*sqrt(3)*cos(n*Pi/6)*sin(n*Pi/6) - sqrt(3)*cos(n*Pi/2)*sin(n*Pi/6) + 3*sin(n*Pi/6)*sin(n*Pi/2). (End)
MAPLE
A156283:=n->[1, 2, 4, -4, -2, -1][(n mod 6)+1]: seq(A156283(n), n=0..100); # Wesley Ivan Hurt, Jun 23 2016
MATHEMATICA
PadRight[{}, 80, {1, 2, 4, -4, -2, -1}] (* or *) LinearRecurrence[{-1, -1, -1, -1, -1}, {1, 2, 4, -4, -2}, 80] (* Harvey P. Dale, May 29 2013 *)
PROG
(Magma) &cat [[1, 2, 4, -4, -2, -1]^^20]; // Wesley Ivan Hurt, Jun 23 2016
CROSSREFS
Cf. A141425.
Sequence in context: A108620 A070512 A156346 * A126123 A285349 A256066
KEYWORD
sign,easy
AUTHOR
Paul Curtz, Feb 07 2009
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 April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)