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!)
A010681 Period 2: repeat (0,10). 0
0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = 5*[1-(-1)^n] = 10*(n mod 2). - Paolo P. Lava, Oct 20 2006
G.f.: 10x/((1-x)(1+x)). - R. J. Mathar, Nov 21 2011
MATHEMATICA
PadRight[{}, 120, {0, 10}] (* Harvey P. Dale, Jan 15 2016 *)
PROG
(PARI) a(n)=n%2*10 \\ Charles R Greathouse IV, Jul 13 2016
CROSSREFS
Sequence in context: A063741 A320227 A284780 * A095418 A055961 A341504
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 April 24 14:18 EDT 2024. Contains 371960 sequences. (Running on oeis4.)