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.

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

Original entry on oeis.org

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

Views

Author

Paul Curtz, Aug 06 2008

Keywords

Programs

Formula

G.f.: x*(1+2*x+4*x^2+5*x^3+7*x^4+8*x^5)/((1-x)*(1+x)*(1-x+x^2)*(1+x+x^2)). - R. J. Mathar, Nov 11 2008
a(n) = 9/2 - 3*cos(Pi*(n-1)/3)/2 - 3^(3/2)*sin(Pi*(n-1)/3)/2 - 3*cos(2*Pi*(n-1)/3)/2 - 3^(1/2)*sin(2*Pi*(n-1)/3)/2 + (-1)^n/2. - R. J. Mathar, Oct 08 2011
From Wesley Ivan Hurt, Apr 20 2015: (Start)
Recurrence: a(n) = a(n-6) for n>6.
a(n) = (2+3*(5-n mod 3))*(n-1 mod 2)+(1+3*(1-n mod 3))*(n mod 2). (End)
E.g.f.: 3*cos(sqrt(3)*x/2)*cosh(x/2) + 5*cosh(x) - sqrt(3)*sin(sqrt(3)*x/2)*(2*cosh(x/2) + sinh(x/2)) + 4*sinh(x) - 8. - Stefano Spezia, Aug 04 2025