login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010681 Period 2: repeat (0,10). 0

%I #19 Feb 26 2020 21:29:45

%S 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,

%T 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,

%U 0,10,0,10,0,10,0,10,0,10,0,10

%N Period 2: repeat (0,10).

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).

%F a(n) = 5*[1-(-1)^n] = 10*(n mod 2). - _Paolo P. Lava_, Oct 20 2006

%F G.f.: 10x/((1-x)(1+x)). - _R. J. Mathar_, Nov 21 2011

%t PadRight[{},120,{0,10}] (* _Harvey P. Dale_, Jan 15 2016 *)

%o (PARI) a(n)=n%2*10 \\ _Charles R Greathouse IV_, Jul 13 2016

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 18 15:25 EDT 2024. Contains 376000 sequences. (Running on oeis4.)