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.

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

Original entry on oeis.org

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

Views

Author

Paul Curtz, Apr 28 2010

Keywords

Crossrefs

Cf. A056594.

Programs

Formula

a(n) = 4/gcd(n,4). - Michael Somos, Jan 06 2011
a(n) = 4-(1+(-1)^n)*(5+I^n)/4. - Bruno Berselli, Mar 22 2011
G.f.: ( 1+4*x+2*x^2+4*x^3 ) / ( (1-x)*(1+x)*(x^2+1) ). - R. J. Mathar, Mar 21 2011
From Wesley Ivan Hurt, Jul 11 2016: (Start)
a(n) = a(n-4) for n>3.
a(n) = 2^((5-(-I)^n-I^n-3*I^(2*n))/4) where I=sqrt(-1). (End)