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!)
A010677 Period 2: repeat (0,6). 3
0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0, 6, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = 3*[1-(-1)^n] = 6*(n mod 2). - Paolo P. Lava, Oct 20 2006
G.f. 6x/((1-x)(1+x)). - R. J. Mathar, Nov 21 2011
MATHEMATICA
Table[6 Mod[n, 2], {n, 0, 50}] (* Jinyuan Wang, Feb 26 2020 *)
PadRight[{}, 100, {0, 6}] (* Harvey P. Dale, Aug 10 2023 *)
PROG
(PARI) a(n)=n%2*6 \\ Charles R Greathouse IV, Jul 13 2016
CROSSREFS
Sequence in context: A280508 A217221 A158090 * A021169 A303494 A198368
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 21 19:35 EDT 2024. Contains 372738 sequences. (Running on oeis4.)