OFFSET
1,2
COMMENTS
For odd n, a(n) is odd. For even n, a(n) = 2*a(n/2).
Conjecture: iterations of a() stabilize at a power of 2, or at a 2-cycle (5*2^t,7*2^t).
LINKS
Max Alekseyev, Proof that representation 3^n s - \sum_{k=0}^{n-1} 3^{n-k-1} 2^{a_k} = 2^m exists for any s. MathOverflow, 2019.
FORMULA
a(n) = A053645(3*n).
PROG
(PARI) { A328034(n) = 3*n - 1<<(log(3*n+.5)\log(2)); }
CROSSREFS
KEYWORD
nonn
AUTHOR
Max Alekseyev, Nov 10 2019
STATUS
approved