cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A132798 Period 6: repeat [0, 2, 1, 0, -2, -1].

Original entry on oeis.org

0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1, 0, 2, 1, 0, -2, -1
Offset: 0

Views

Author

Paul Curtz, Nov 21 2007

Keywords

Crossrefs

Programs

Formula

G.f.: x*(2+x)/((x+1)*(x^2-x+1)) = (1/3)*(4*x+1)/(x^2-x+1)-(1/3)/(x+1). - R. J. Mathar, Nov 28 2007
a(n) + a(n+1) = A117373(n+4). - R. J. Mathar, Jul 22 2009
a(n) = (-n mod 3) * (-1)^floor(n/3) = A080425(n) * (-1)^A002264(n) = A080425(n) * A130151(n). - Wesley Ivan Hurt, Jun 20 2014
From Wesley Ivan Hurt, Jun 21 2016: (Start)
a(n) + a(n-3) = 0 for n>2.
a(n) = sin(n*Pi/3) * (3*sqrt(3) + 2*sin(2*n*Pi/3))/3. (End)