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.

A130196 Period 3: repeat [1, 2, 2].

Original entry on oeis.org

1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 2
Offset: 0

Views

Author

Paul Curtz, Aug 05 2007

Keywords

Comments

From Reinhard Zumkeller, Nov 12 2009: (Start)
Denominator of x(n) = x(n-1) + x(n-2), x(0)=0, x(1)=1/2; numerator = A167808;
a(n) = A131534(n) + A022003(n) = A080425(n) - A131534(n) + 2 = A153727(n)/A131534(n). (End)
Continued fraction expansion of (5+sqrt(85))/10. - Klaus Brockhaus, May 07 2010

Crossrefs

Cf. A177347 (decimal expansion of (5+sqrt(85))/10).

Programs

Formula

a(n+3) = a(n) with a(0)=1, a(1)=a(2)=2.
G.f.: (1+2*x+2*x^2)/(1-x)*(x^2+x+1). - R. J. Mathar, Nov 14 2007
a(n) = (5 - 2*cos(2*Pi*n/3))/3. - Jaume Oliver Lafont, Nov 23 2008
a(n) = 2 - 0^(n mod 3). - Reinhard Zumkeller, Nov 12 2009
a(n) = A011655(n) + 1 = (n^2 mod 3) + 1. - Boris Putievskiy, Feb 03 2013
a(n) = floor((n+1)*5/3) - floor(n*5/3). - Hailey R. Olafson, Jul 23 2014
E.g.f.: (5*exp(x) - 2*exp(-x/2)*cos(sqrt(3)*x/2))/3. - Stefano Spezia, Jun 03 2021

Extensions

More terms from Klaus Brockhaus, May 07 2010
Showing 1-1 of 1 results.