A010679 - OEIS

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

Other ways to Give

A010679

Period 2: repeat (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, 8, 0

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

LINKS

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

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

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 *)