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.

A134977 Period 6: repeat [1, 4, 2, 3, 0, 2].

Original entry on oeis.org

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

Views

Author

Paul Curtz, Feb 04 2008

Keywords

Comments

Northwest diagonal sums of A134658, omitting row 0.

Crossrefs

Programs

Formula

O.g.f.: -1/(x+1)-2/(x-1)+x/(x^2-x+1). a(n) = 2-(-1)^n+A010892(n-1). - R. J. Mathar, Feb 08 2008
From Wesley Ivan Hurt, Jun 18 2016: (Start)
a(n) = a(n-1) - a(n-3) + a(n-4) for n>3.
a(n) = (6-3*cos(n*Pi)+2*sqrt(3)*sin(n*Pi/3))/3. (End)