login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010695 Period 2: repeat (2,5). 6
2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2, 5, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Also decimal expansion of 25/99.

Continued fraction expansion of A176052. - R. J. Mathar, Mar 08 2012

LINKS

Table of n, a(n) for n=0..80.

Index entries for linear recurrences with constant coefficients, signature (0,1).

FORMULA

a(n) = -3/2*(-1)^n + 7/2 = 5*(n mod 2) + 2*((n+1) mod 2). - Paolo P. Lava, Oct 20 2006

G.f.: (2+5*x)/((1-x)*(1+x)). - R. J. Mathar, Nov 21 2011

a(n) = 2^(1-(-1)^n) + 1. [Bruno Berselli, Dec 29 2015]

From Nicolas Bělohoubek, Nov 11 2021: (Start)

a(n) = 10/a(n-1). See also A010691.

a(n) = 7 - a(n-1). See also A010702. (End)

PROG

(Maxima) makelist(if evenp(n) then 2 else 5, n, 0, 80); /* Martin Ettl, Nov 09 2012 */

(Magma) &cat [[2, 5]^^50]; // Bruno Berselli, Dec 29 2015

CROSSREFS

Cf. A010674 (2^(1-(-1)^n) - 1).

Cf. A010691.

Sequence in context: A220342 A221676 A073054 * A021400 A059855 A082881

Adjacent sequences: A010692 A010693 A010694 * A010696 A010697 A010698

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Edited by Bruno Berselli, Dec 29 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 27 19:23 EST 2022. Contains 358406 sequences. (Running on oeis4.)