login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A010679
Period 2: repeat (0,8).
1
0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0
OFFSET
0,2
FORMULA
a(n) = 4*(1-(-1)^n) = 8*(n mod 2). - Paolo P. Lava, Oct 20 2006
G.f.: 8*x/((1-x)*(1+x)). - R. J. Mathar, Nov 21 2011
a(n) = 3^(1-(-1)^n) - 1. - Bruno Berselli, Dec 29 2015
MATHEMATICA
PadRight[{}, 120, {0, 8}] (* Harvey P. Dale, Dec 21 2015 *)
PROG
(Magma) &cat [[0, 8]^^40]; // Bruno Berselli, Dec 29 2015
(PARI) a(n)=n%2*8 \\ Charles R Greathouse IV, Jul 26 2016
CROSSREFS
Cf. A010700: 3^(1-(-1)^n) + 1.
Sequence in context: A066606 A048729 A003131 * A347157 A186981 A347159
KEYWORD
nonn,easy
AUTHOR
STATUS
approved