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.

A117444 Period 5: Repeat [0, 1, 2, -2, -1].

Original entry on oeis.org

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

Views

Author

Paul Barry, Mar 16 2006

Keywords

Comments

See the comments in A203571 concerning formulas of the n-th term of periodic sequences. - M. F. Hasler, Jan 13 2013

Crossrefs

Cf. A061347.

Programs

Formula

G.f.: x*(1+3*x+x^2)/(1+x+x^2+x^3+x^4) = x*(1+2*x^2-2*x^3-x^4)/(1-x^5).
a(n) = (1/2)*Sum_{k=0..5} L(k*(k^2-n)/5), where L(j/p) is the Legendre symbol of j and p.
a(n) = sqrt(2+2/sqrt(5))*sin(2*Pi*n/5)-sqrt(2-2/sqrt(5))*sin(4*Pi*n/5).
a(n) = -2 + floor(23401/99999*10^(n+1)) mod 10. - Hieronymus Fischer, Jan 03 2013
a(n) = -2 + floor(863/1562*5^(n+1)) mod 5. - Hieronymus Fischer, Jan 04 2013
a(n) = 2 - ((2-n) mod 5). - Wesley Ivan Hurt, Jul 12 2014
a(n) = - a(n-1) - a(n-2) - a(n-3) - a(n-4). - Wesley Ivan Hurt, Sep 05 2022

Extensions

More terms from Wesley Ivan Hurt, Jul 12 2014