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.

A132951 Period 6: repeat [1, 3, 1, -1, -3, -1].

Original entry on oeis.org

1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1, 1, 3, 1, -1, -3, -1
Offset: 0

Views

Author

Paul Curtz, Nov 22 2007

Keywords

Crossrefs

Programs

Formula

a(n) = 3*a(n-1)-a(n-3)+3*a(n-4).
O.g.f.: (1+3*x+x^2)/((x+1)*(x^2-x+1)) = -(1/3)/(x+1)+(1/3)*(4*x+4)/(x^2-x+1). - R. J. Mathar, Nov 28 2007
a(n) = -(1/3)*(-1)^n+(4/3)*cos(Pi*n/3)+(4*3^0.5/3)*sin(Pi*n/3). - Richard Choulet, Jan 02 2008
a(n) = a(n-6) = A131531(n+3)+A131531(n+1)+3*A131531(n+2). - R. J. Mathar, Apr 04 2008
a(n) = A109007(n+2) * A130151(n). - Wesley Ivan Hurt, Jun 22 2013

Extensions

Edited by N. J. A. Sloane, May 16 2008 at the suggestion of R. J. Mathar.