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!)
A280569 a(n) = (-1)^n * 2 if n = 5*k and n!=0, otherwise a(n) = (-1)^n. 0

%I #15 Sep 08 2022 08:46:18

%S 1,-1,1,-1,1,-2,1,-1,1,-1,2,-1,1,-1,1,-2,1,-1,1,-1,2,-1,1,-1,1,-2,1,

%T -1,1,-1,2,-1,1,-1,1,-2,1,-1,1,-1,2,-1,1,-1,1,-2,1,-1,1,-1,2,-1,1,-1,

%U 1,-2,1,-1,1,-1,2,-1,1,-1,1,-2,1,-1,1,-1,2,-1,1,-1,1

%N a(n) = (-1)^n * 2 if n = 5*k and n!=0, otherwise a(n) = (-1)^n.

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

%F Euler transform of length 10 sequence [-1, 1, 0, 0, -1, -1, 0, 0, 0, 1].

%F a(n) = -b(n) where b() is multiplicative with b(2^e) = -1 if e>0, b(5^e) = 2 if e>0, b(p^e) = 1 otherwise.

%F G.f.: (1 - x + x^2) * (1 - x^3) / (1 + x^5).

%F G.f.: 1 - x / (1 + x) - x^5 / (1 + x^5).

%F a(n) = a(-n) for all n in Z.

%F a(5*n) = A280560(n) for all n in Z.

%e G.f. = 1 - x + x^2 - x^3 + x^4 - 2*x^5 + x^6 - x^7 + x^8 - x^9 + 2*x^10 + ...

%t a[ n_] := (-1)^n If[ n != 0 && Divisible[n, 5], 2, 1];

%t LinearRecurrence[{0,0,0,0,-1},{1,-1,1,-1,1,-2},120] (* or *) PadRight[ {1},120,{2,-1,1,-1,1,-2,1,-1,1,-1}] (* _Harvey P. Dale_, Jul 18 2021 *)

%o (PARI) {a(n) = (-1)^n * if(n && n%5==0, 2, 1)};

%o (PARI) {a(n) = n=abs(n); polcoeff( (1 - x + x^2) * (1 - x^3) / (1 + x^5) + x * O(x^n), n)};

%o (Magma) m:=75; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!((1 - x+x^2)*(1-x^3)/(1+x^5))); // _G. C. Greubel_, Jul 29 2018

%Y Cf. A280560.

%K sign

%O 0,6

%A _Michael Somos_, Jan 05 2017

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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)