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.

A131800 Period 4: repeat [1, 2, 5, 6].

Original entry on oeis.org

1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6, 1, 2, 5, 6
Offset: 0

Views

Author

Salvatore Gambino (salvatore.gambino(AT)fastwebnet.it), Oct 04 2007

Keywords

Comments

Decimal expansion of 1256/9999. - Klaus Brockhaus, May 20 2010

Crossrefs

Cf. A000111, A178131 (decimal expansion of (11+3*sqrt(21))/17).

Programs

Formula

a(n) = (7 + (-1)^n + 4*(-1)^(2*n + 1 - (-1)^n)/4)/2.
G.f.: (1 + 2*x + 5*x^2 + 6*x^3)/((1-x)*(x+1)*(x^2+1)). - R. J. Mathar, Jan 13 2008
a(n) = A000111(n+2) mod 10.
a(n) = 7/2 - 2*cos(Pi*n/2) - 2*sin(Pi*n/2) - (-1)^n/2. - R. J. Mathar, Oct 08 2011
a(n) = a(n-4) for n>3. - Wesley Ivan Hurt, Jul 10 2016

Extensions

More terms from R. J. Mathar, Jan 13 2008