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.

A155158 Period 4: repeat [1, 5, 7, 3].

Original entry on oeis.org

1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5, 7, 3, 1, 5
Offset: 0

Views

Author

Paul Curtz, Jan 21 2009

Keywords

Crossrefs

Programs

Formula

a(n) = A048473(n) mod 10.
First differences: a(n+1)-a(n) = (-1)^floor(n/2)*A010694(n+1).
Second differences: a(n+2)-2*a(n+1)+a(n) = (-1)^floor(1+n/2)*A010696(n).
Third differences: a(n+3)-3*a(n+2)+3*a(n+1)-a(n) = (-1)^floor((n+3)/2)*A105398(n).
G.f.: (1+4*x+3*x^2)/(1-x+x^2-x^3). - Colin Barker, Feb 28 2012
a(n) = a(n-1) - a(n-2) + a(n-3) for n>2. - Wesley Ivan Hurt, Jul 08 2016