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.

A131186 Period 12: repeat 0, 1, 2, 0, 2, 4, 0, 4, 3, 0, 3, 1.

Original entry on oeis.org

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

Views

Author

Paul Curtz, Sep 25 2007

Keywords

Formula

O.g.f.: -(x^5+3x^4-x^3-x^2+2x+1)*x/((x-1)(x^2+x+1)(x^4-x^2+1)) . - R. J. Mathar, Jan 15 2008
a(n+1) = sum(A211313(n, k), k=0..n) mod 5 - Johannes W. Meijer, Jul 19 2013
a(n) = a(n-2) + a(n-3) - a(n-4) - a(n-5) + a(n-7) for n > 6. - Chai Wah Wu, Feb 16 2021

Extensions

More terms from R. J. Mathar, Jan 15 2008