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.

A131372 Period 7: repeat [1, -1, 0, 1, 0, -1, 1].

Original entry on oeis.org

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

Views

Author

Paul Curtz, Oct 01 2007

Keywords

Examples

			G.f. = 1 - x + x^3 - x^5 + x^6 + x^7 - x^8 + x^10 - x^12 + x^13 + x^14 + ...
		

Crossrefs

Programs

Formula

From Wesley Ivan Hurt, Dec 23 2016: (Start)
G.f.: (1 - x + x^3 - x^5 + x^6)/(1 - x^7).
a(n) = a(n-7) for all n in Z.
a(n) = 1 - floor((1-n)/7) + floor((3-n)/7) - floor((5-n)/7) + floor((6-n)/7) + floor((7-n)/7) + floor((n-7)/7) + floor((n-6)/7) - floor((n-5)/7) + floor((n-3)/7) - floor((n-1)/7). (End)
G.f.: 1 / (1 + x / (1 - x / (1 + x / (1 - x / (1 - x^2 / (1 + x^4 / (1 + x^3))))))). - Michael Somos, Dec 26 2016
a(n) = (-1)^(mod(mod(n, 7), 3)>0) * A098457(n+1). - Michael Somos, Dec 26 2016