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.

A130658 Period 4: repeat [1, 1, 2, 2].

Original entry on oeis.org

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

Views

Author

Paul Curtz, Jun 21 2007

Keywords

Comments

Continued fraction expansion of (9+sqrt(221))/14. - Klaus Brockhaus, May 03 2010
From Klaus Brockhaus, May 14 2010: (Start)
Decimal expansion of 34/303.
a(n) = A014695(n+3). (End)
Lengths of runs in A214090. - Reinhard Zumkeller, Jul 06 2012

Crossrefs

Programs

Formula

G.f.: ( 1+2*x^2 ) / ( (1-x)*(1+x^2) ). - R. J. Mathar, Jan 18 2011
a(n) = (n^3 mod 4 + (n+1)^3 mod 4 + 1)/2. - Gary Detlefs, Apr 15 2011
a(n) = -1/2*cos(1/2*Pi*n)-1/2*sin(1/2*Pi*n)+3/2. - Leonid Bedratyuk, May 13 2012
From Wesley Ivan Hurt, May 30 2015: (Start)
a(n) = a(n-1) - a(n-2) + a(n-3), n>3.
a(n) = (3+(-1)^((2*n+3+(-1)^n)/4))/2. (End)
From Wesley Ivan Hurt, Jul 11 2016: (Start)
a(n) = a(n-4) for n>3.
a(n) = A021913(n) + 1. (End)

Extensions

More terms from Klaus Brockhaus, May 14 2010