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.

A130974 Period 6: repeat [1, 1, 1, 3, 3, 3].

Original entry on oeis.org

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

Views

Author

Paul Curtz, Sep 28 2007

Keywords

Crossrefs

Cf. A177957 (decimal expansion of (12+3*sqrt(35))/19). - Klaus Brockhaus, May 16 2010

Programs

Formula

G.f.: (1+3*x^3)/((1-x)*(1+x)*(1-x+x^2)). - R. J. Mathar, Nov 15 2007
a(n) = 2 - (2/3)*cos((1/3)*Pi*n) - (2/3)*3^(1/2)*sin((1/3)*Pi*n) + (1/3)*(-1)^(1+n). - R. J. Mathar, Nov 15 2007
a(n) = 2 - (-1)^floor(n/3). - Bruno Berselli, Jul 09 2013
a(n) = a(n-1) - a(n-3) + a(n-4) for n > 3. - Wesley Ivan Hurt, Jun 20 2016