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.

A010703 Period 2: repeat (3,5).

Original entry on oeis.org

3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5
Offset: 0

Views

Author

Keywords

Comments

From Klaus Brockhaus, Dec 10 2009: (Start)
Interleaving of A010701 and A010716.
Also continued fraction expansion of (15+sqrt(285))/10.
Also decimal expansion of 35/99.
Binomial transform of 3 followed by A084633 without initial terms 1,0.
Inverse binomial transform of A171497. (End)

Crossrefs

Cf. A010701 (all 3's sequence), A010716 (all 5's sequence), A084633 (inverse binomial transform of repeated odd numbers), A171497.

Programs

Formula

From Klaus Brockhaus, Dec 10 2009: (Start)
a(n) = a(n-2) for n > 1; a(0) = 3, a(1) = 5.
G.f.: (3+5*x)/((1-x)*(1+x)). (End)
a(n) = 4 - (-1)^n. - Aaron J Grech, Aug 02 2024
E.g.f.: 3*cosh(x) + 5*sinh(x). - Stefano Spezia, Aug 04 2024