The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A010713 Period 2: repeat (4,8). 2
 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4, 8, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Index entries for linear recurrences with constant coefficients, signature (0,1). FORMULA a(n) = -2*(-1)^n + 6 = 8*(n mod 2) + 4*[(n+1) mod 2]. - Paolo P. Lava, Oct 20 2006 From R. J. Mathar, Oct 20 2008: (Start) a(n) = 4*A000034(n). G.f.: 4(1+2x)/((1-x)(1+x)). (End) MATHEMATICA Table[4 + 4 Mod[n, 2], {n, 0, 50}] (* Jinyuan Wang, Feb 26 2020 *) PROG (PARI) a(n)=4+n%2*4 \\ Charles R Greathouse IV, Dec 21 2011 CROSSREFS Cf. A176218. Sequence in context: A247318 A019838 A155970 * A105398 A005883 A055026 Adjacent sequences:  A010710 A010711 A010712 * A010714 A010715 A010716 KEYWORD nonn,easy AUTHOR STATUS approved

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

Last modified November 30 20:55 EST 2020. Contains 338812 sequences. (Running on oeis4.)