OFFSET
1,18
COMMENTS
a(1) = 1, any other choice simply adds a factor to all terms.
The even bisection of the sequence seems to behave similarly to A281487 with similar asymptotics for |a(n)|. However, the odd bisection shows oscillations with increasing intervals between crossing the zero and increasing amplitude.
LINKS
Andrey Zabolotskiy, Table of n, a(n) for n = 1..20000
Dana G. Korssjoen, Biyao Li, Stefan Steinerberger, Raghavendra Tripathi, and Ruimin Zhang, Finding structure in sequences of real numbers via graph theory: a problem list, Involve, 15 (2022), 251-270; arXiv preprint, arXiv:2012.04625 [math.CO], 2020-2021.
FORMULA
a(1) = 1, a(n) = -Sum_{d|(n-2), 1 <= d < n} a(d) for n>1.
PROG
(Python)
a = [1]
for n in range(2, 100):
a.append(-sum(a[d-1] for d in range(1, n) if (n-2)%d == 0))
print(a)
CROSSREFS
AUTHOR
Andrey Zabolotskiy, Jan 22 2017
STATUS
approved