JavaScript (ES6), 26 bytes
Returns the \$n\$-th term of the sequence. Relies on arithmetic underflow to stop the recursion.
f=n=>n?(-n%4/3|1)*f(n/2):1
Arnauld
- 197.6k
- 20
- 179
- 650