The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
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

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 May 12 22:37 EDT 2024. Contains 372497 sequences. (Running on oeis4.)