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.

A010679 Period 2: repeat (0,8).

Original entry on oeis.org

0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0
Offset: 0

Views

Author

Keywords

Crossrefs

Cf. A010700: 3^(1-(-1)^n) + 1.

Programs

Formula

a(n) = 4*(1-(-1)^n) = 8*(n mod 2). - Paolo P. Lava, Oct 20 2006
G.f.: 8*x/((1-x)*(1+x)). - R. J. Mathar, Nov 21 2011
a(n) = 3^(1-(-1)^n) - 1. - Bruno Berselli, Dec 29 2015