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.

A131756 Period 3: repeat [2, -1, 3].

Original entry on oeis.org

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

Views

Author

Paul Curtz, Oct 04 2007

Keywords

Crossrefs

Cf. A130784.

Programs

Formula

a(n) = 4/3+2/3*cos(2/3*Pi*n)-4/3*3^(1/2)*sin(2/3*Pi*n). - R. J. Mathar, Nov 15 2007
G.f.: (2-x+3*x^2)/(1-x^3). - Jaume Oliver Lafont, Mar 24 2009
a(n) = a(n-3) for n>2. - Wesley Ivan Hurt, Jul 01 2016