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.

A112132 Period 4: repeat [1, 3, 1, 7].

Original entry on oeis.org

1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1, 7, 1, 3, 1
Offset: 1

Views

Author

Antti Karttunen, Aug 28 2005

Keywords

Crossrefs

First differences of A112062.
Also half of the first differences of A112072. Cf. A112086.

Programs

Formula

a(n+1) = 3-2*sin(Pi*n/2)-2*(-1)^n. - R. J. Mathar, Oct 08 2011
Multiplicative with a(2) = 3, a(2^e) = 7 if e >= 2, a(p^e) = 1 otherwise. - Antti Karttunen, Mar 31 2013, typo corrected May 02 2020
From Wesley Ivan Hurt, Jul 09 2016: (Start)
G.f.: x*(1+3*x+x^2+7*x^3)/(1-x^4).
a(n) = a(n-4) for n>4.
a(2n) = 5+2*(-1)^n, a(2n-1) = 1. (End)
Dirichlet g.f.: zeta(s)*(1+2^(1-s)+4^(1-s)). - Amiram Eldar, Jan 03 2023