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!)
A308077 G.f. A(x) satisfies: A(x) = x - A(x^2) + A(x^3) - A(x^4) + A(x^5) - A(x^6) + ... 8
1, -1, 1, 0, 1, -3, 1, 0, 2, -3, 1, 2, 1, -3, 3, 0, 1, -8, 1, 2, 3, -3, 1, 0, 2, -3, 4, 2, 1, -13, 1, 0, 3, -3, 3, 10, 1, -3, 3, 0, 1, -13, 1, 2, 8, -3, 1, 0, 2, -8, 3, 2, 1, -20, 3, 0, 3, -3, 1, 18, 1, -3, 8, 0, 3, -13, 1, 2, 3, -13, 1, -4, 1, -3, 8, 2, 3, -13, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
FORMULA
a(1) = 1; a(n) = Sum_{d|n, d<n} (-1)^(n/d+1)*a(d).
MAPLE
a:= proc(n) option remember; `if`(n<2, n, add(a(n/d)*
(-1)^(d-1), d=numtheory[divisors](n) minus {1}))
end:
seq(a(n), n=1..80); # Alois P. Heinz, Mar 30 2023
MATHEMATICA
terms = 79; A[_] = 0; Do[A[x_] = x + Sum[(-1)^(k + 1) A[x^k], {k, 2, terms}] + O[x]^(terms + 1) // Normal, terms + 1]; Rest[CoefficientList[A[x], x]]
a[n_] := If[n == 1, n, Sum[If[d < n, (-1)^(n/d + 1) a[d], 0], {d, Divisors[n]}]]; Table[a[n], {n, 1, 79}]
CROSSREFS
Cf. A006005 (positions of 1's), A067856, A307776, A347031.
Sequence in context: A119734 A073200 A307765 * A336344 A352609 A198345
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, May 11 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 May 13 23:15 EDT 2024. Contains 372524 sequences. (Running on oeis4.)