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.

A173598 Period 6: repeat [1, 8, 7, 2, 4, 5].

Original entry on oeis.org

1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8, 7, 2, 4, 5, 1, 8
Offset: 0

Views

Author

Paul Curtz, Nov 23 2010

Keywords

Comments

For A141425 = 1,2,4,5,7,8 permutations, see A153130. a(n) is based on A022998. Successive differences are linked to A070366.

Crossrefs

Programs

Formula

a(n) = A166138(n) mod 9.
a(2n+1) + a(2n+2) = 9.
G.f.: (1+8*x+7*x^2+2*x^3+4*x^4+5*x^5) / ((1-x)*(1+x)*(1+x+x^2)*(x^2-x+1)). - R. J. Mathar, Mar 08 2011
From Wesley Ivan Hurt, Jun 23 2016: (Start)
a(n) = a(n-6) for n>5.
a(n) = (9 - cos(n*Pi) - 6*cos(2*n*Pi/3) + 2*sqrt(3)*sin(n*Pi/3))/2. (End)