2 problems

Let $a(n)$ be defined by writing $n$ in binary, appending a $1$ to each run of $1$'s and a $0$ to each run of $0$'s, and interpreting the resulting binary string as an integer. A r…

Boundary-regularity conjecture. For every $r\ge2$, condition (vi) can be weakened to