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!)
A343493 a(n) = 1 - Sum_{d|n, d < n} a(d - 1). 1
1, 1, 0, 0, -1, 0, -1, 0, -1, 0, 0, 0, -1, 0, 0, 1, -1, 0, 0, 0, 0, 1, -1, 0, -1, 1, 0, 1, 0, 0, 0, 0, -2, 0, 0, 2, 0, 0, -1, 1, 0, 0, 0, 0, -2, 2, 0, 0, -2, 1, 1, 1, -1, 0, 0, 1, -1, 0, -1, 0, 0, 0, -1, 2, -2, 2, 0, 0, 0, 1, 1, 0, -2, 0, -1, 2, -1, 1, 0, 0, -2, 1, -1, 0, -1, 2, -1, 0, -2, 0, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,33
LINKS
FORMULA
G.f. A(x) satisfies: A(x) = 1 / (1 - x) - x^2 * A(x^2) - x^3 * A(x^3) - x^4 * A(x^4) - ...
MATHEMATICA
a[n_] := a[n] = 1 - Sum[If[d < n, a[d - 1], 0], {d, Divisors[n]}]; Table[a[n], {n, 0, 90}]
nmax = 90; A[_] = 0; Do[A[x_] = 1/(1 - x) - Sum[x^k A[x^k], {k, 2, nmax}] + O[x]^(nmax + 1) //Normal, nmax + 1]; CoefficientList[A[x], x]
PROG
(Python)
from functools import lru_cache
from sympy import divisors
@lru_cache(maxsize=None)
def A343493(n): return 1-sum(A343493(d-1) for d in divisors(n) if d < n) # Chai Wah Wu, Apr 17 2021
CROSSREFS
Sequence in context: A341775 A139032 A182035 * A095808 A281453 A079807
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, Apr 17 2021
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 20 06:19 EDT 2024. Contains 372703 sequences. (Running on oeis4.)