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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A010696 Periodic sequence: Repeat 2,6. 10
 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2, 6, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Original name: Period 2. Also continued fraction expansion of 1+(2/3)*sqrt(3). - Bruno Berselli, Sep 22 2011 LINKS Table of n, a(n) for n=0..80. Index entries for linear recurrences with constant coefficients, signature (0,1) FORMULA a(n) = -2*(-1)^n+4. a(n) = 6*(n mod 2)+2*((n+1) mod 2). - Paolo P. Lava, Oct 20 2006 G.f.: ( -2-6*x ) / ( (x-1)*(1+x) ). - R. J. Mathar, Jul 07 2011 a(n) = a(-n) = 2*A010684(n) = A131800(2n+1) = A010123(2n+2). - Bruno Berselli, Sep 22 2011 CROSSREFS Cf. A174114. [From Reinhard Zumkeller, Mar 08 2010] Sequence in context: A342982 A128045 A011325 * A021796 A127356 A232273 Adjacent sequences: A010693 A010694 A010695 * A010697 A010698 A010699 KEYWORD nonn,easy AUTHOR N. J. A. Sloane. EXTENSIONS Definition rewritten by Bruno Berselli, Sep 22 2011 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.

Last modified December 8 13:09 EST 2023. Contains 367679 sequences. (Running on oeis4.)