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.

A133145 Period 4: repeat [1, 2, 4, 8].

Original entry on oeis.org

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

Views

Author

Paul Curtz, Dec 16 2007

Keywords

Crossrefs

Cf. A069705. [Jaume Oliver Lafont, Mar 27 2009]

Programs

Formula

a(n) == 2*a(n-1) mod 15.
a(n) = 2^(n mod 4). - Jaume Oliver Lafont, Mar 27 2009
a(n) = A160700(A000079(n)). [Reinhard Zumkeller, Jun 10 2009]
a(n) = 2^n (mod 15). G.f.: (1+2*x)*(4*x^2+1)/ ((1-x)*(1+x)*(x^2+1)). [R. J. Mathar, Apr 13 2010]
From Wesley Ivan Hurt, Jul 09 2016: (Start)
a(n) = a(n-4) for n>3.
a(n) = (15-6*cos(n*Pi/2)-5*cos(n*Pi)-12*sin(n*Pi/2)-5*I*sin(n*Pi))/4. (End)