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.

A138019 Period 5: repeat [1, 1, 0, -1, -1].

Original entry on oeis.org

1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1, -1, 1, 1, 0, -1
Offset: 0

Views

Author

Paul Curtz, May 01 2008

Keywords

Examples

			G.f. = 1 + x - x^3 - x^4 + x^5 + x^6 - x^8 - x^9 + x^10 + x^11 - x^13 + ...
		

Crossrefs

Programs

Formula

Inverse binomial transform of A138003.
O.g.f.: (1+x)(x^2+x+1)/(1+x+x^2+x^3+x^4). - R. J. Mathar, Jun 28 2008
Euler transform of length 5 sequence [ 1, -1, -1, 0, 1]. - Michael Somos, Jun 17 2015
G.f.: (1 - x^2 ) * (1 - x^3) / ((1 - x) * (1 - x^5)). - Michael Somos, Jun 17 2015
a(n) = -a(-1-n) = a(n+5) for all n in Z. - Michael Somos, Jun 17 2015