OFFSET
0,6
FORMULA
a(0) = 1; a(n) = Sum_{k=0..n-1} (-1)^A010060(k) * (binomial(n-1,k) mod 2) * a(n-k-1).
MATHEMATICA
a[0] = 1; a[n_] := a[n] = Sum[(-1)^ThueMorse[k] Mod[Binomial[n - 1, k], 2] a[n - k - 1], {k, 0, n - 1}]; Table[a[n], {n, 0, 65}]
PROG
(Python)
from functools import lru_cache
@lru_cache(maxsize=None)
def A380652(n): return sum((-A380652(n-k-1) if k.bit_count()&1 else A380652(n-k-1)) for k in range(n) if not (k&~(n-1))) if n else 1 # Chai Wah Wu, Feb 11 2025
CROSSREFS
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, Jan 29 2025
STATUS
approved
