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.

A010726 Period 2: repeat (6,10).

Original entry on oeis.org

6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10, 6, 10
Offset: 0

Views

Author

Keywords

Comments

From Klaus Brockhaus, Dec 10 2009: (Start)
Interleaving of A010722 and A010692.
Also continued fraction expansion of 3 + 4*sqrt(15)/5.
Binomial transform of 6 followed by A122803 without initial terms 1,-2.
Inverse binomial transform of A171494. (End)

Crossrefs

Equals 2*A010703. Cf. A010722 (all 6's sequence), A010692 (all 10's sequence), A122803 (powers of -2), A171494. - Klaus Brockhaus, Dec 10 2009

Programs

Formula

a(n) = -2*(-1)^n + 8. - Paolo P. Lava, Oct 27 2006
From Klaus Brockhaus, Dec 10 2009: (Start)
a(n) = a(n-2) for n > 1; a(0) = 6, a(1) = 10.
G.f.: 2*(3+5*x)/((1-x)*(1+x)). (End)