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.

Showing 1-1 of 1 results.

A135537 Period 4: repeat [7, 5, 2, 4].

Original entry on oeis.org

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

Views

Author

Paul Curtz, Feb 22 2008

Keywords

Crossrefs

Programs

Formula

a(n) = A135536(n) mod 9.
O.g.f.: ((x+5)/(x^2+1)+9*(1-x))/2. a(n) = ((-1)^floor(n/2) * A010686(n+1) + 9)/2. - R. J. Mathar, Feb 23 2008
From Wesley Ivan Hurt, Jul 08 2016: (Start)
a(n) = a(n-1) - a(n-2) + a(n-3) for n>2, a(n) = a(n-4) for n>3.
a(n) = A021408(n) for n>1. (End)
Showing 1-1 of 1 results.