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!)
A323191 Expansion of (1 - x^5) / ((1 + x) * (1 + x^4)) in powers of x. 0
1, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1, -1, 0, -1, 1, -1, 2, -1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,9
LINKS
FORMULA
a(n) = -b(n) and b() is multiplicative with b(2) = -1, b(4) = 0, b(2^e) = -2 if e>2, b(p^e) = 1 if p>2.
Euler transform of length 8 sequence [-1, 1, 0, -1, -1, 0, 0, 1].
Moebius transform is length 8 sequence [-1, 2, 0, -1, 0, 0, 0, 2].
G.f.: (1 - x^5) / ((1 + x) * (1+ x^4)) = -1 + 1 / (1 + x) + 1 / (1 + x^4).
a(n) = a(-n) for all n in Z. a(n+4) = a(n-4) except if n=4 or n=-4.
a(n) = (-1)^n * A257179(n), a(2*n + 1) = -1, a(4*n + 2) = 1, a(8*n + 4) = 0 for all n in Z.
EXAMPLE
G.f. = 1 - x + x^2 - x^3 - x^5 + x^6 - x^7 + 2*x^8 - x^9 + x^10 + ...
MATHEMATICA
a[ n_] := (-1)^n + If[Mod[n, 4] == 0, (-1)^(n/4), 0] - Boole[n == 0];
a[ n_] := {-1, 1, -1, 0, -1, 1, -1, 2}[[Mod[n, 8, 1]]] - Boole[n == 0];
a[ n_] := SeriesCoefficient[ (1 - x^5) / ((1 + x) * (1 + x^4)), {x, 0, Abs@n}];
PROG
(PARI) {a(n) = (-1)^n + if(n%4==0, (-1)^(n/4)) - (n==0)};
(PARI) {a(n) = [2, -1, 1, -1, 0, -1, 1, -1][n%8 + 1] - (n==0)};
(PARI) {a(n) = n=abs(n); polcoeff( (1 - x^5) / ((1 + x) * (1 + x^4)) + x * O(x^n), n)};
(PARI) {a(n) = my(e); n=abs(n); if( n<1, n==0, e=valuation(n, 2); -if( e<3, [1, -1, 0][e+1], -2))};
CROSSREFS
Cf. A257179.
Sequence in context: A281490 A326695 A343749 * A257179 A259042 A350074
KEYWORD
sign,easy
AUTHOR
Michael Somos, Jan 06 2019
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 July 12 17:45 EDT 2024. Contains 374251 sequences. (Running on oeis4.)