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.

A010675 Period 2: repeat (0,4).

Original entry on oeis.org

0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0, 4, 0
Offset: 0

Views

Author

Keywords

Programs

Formula

a(n) = 2*(1-(-1)^n); a(n) = 4*(n mod 2) - Paolo P. Lava, Oct 20 2006
O.g.f.: -2/(1+x)-2/(x-1). - R. J. Mathar, Feb 19 2008
a(n) = 4*(1+floor((n+1)/2)-ceiling((n+1)/2)). - Wesley Ivan Hurt, May 21 2013
a(n) = 4*cos( Pi*(n+1)/2 )^2. - Wesley Ivan Hurt, May 21 2013