Suppose we have an irrational number represented in base $3$ such that there can only be a maximum of $n$ consecutive $1$'s or $2$'s in the ternary expansion. Does this imply there are arbitrarily long sequences of $0$'s in the expansion? Or does such a number even exist?
Consider the substitution $1\mapsto 12,\: 2\mapsto 1$ and iterate this. So $$1\mapsto 12 \mapsto 121\mapsto 12112 \mapsto 12112121 \mapsto \ldots$$ This has a limit word $w$ which respresents an irrational number in ternary (the number $0.w$)
$$0.12112121121121211212112112121121121211212112112121121211211212112112121 \cdots$$ It is irrational because the sequence is not eventually periodic. You can prove this by showing that the ratio of $1$s and $2$s in its expansion is the golden ratio. You can also prove pretty easily that every $2$ is isolated, so it always appears surrounded by two $1$s, and there are no runs of more than two consecutive $1$s.
You can have an irrational number with no consecutive pairs of $0$s, $1$s or $2$s such as
$$0.120121201212120121212120\ldots$$ where the number of $12$s between $0$s increases each time.
Consider the number whose ternary expansion is
where the exponents indicate repetition. In other words, if $b=1^n2$, the number (ignoring leading $0$ and ternary point) is
No sequence of consecutive $1$s is longer than $n$, and no sequence of consecutive $2$s is longer than $2$, but the number is clearly irrational.
Knowing that every sequence of digits defines a real number, and that this number is rational if and only if the sequence is periodic, you question is very easy to answer.
In the stronger interpretation, your hypothesis says that every $n$ consecutive digits must contain a digit $0$. Then if $n\leq1$, all your digits must be $0$, and the number is rational (I assume you did not mean this, but I want my answer to be complete). If $n>1$, then one can already satisfy the condition by making every $n$-th digit a $0$; the remaining digits can be filled in later. Assuming such a sequence, is easy to see that if the whole sequence were periodic, it would still be periodic after removing those digits $0$ at every $n$-th position. By contrapositive, if we can choose the remaining digits in a non-periodic way, the whole sequence will not be periodic, and the number irrational; we'll have a number like you asked for.
So your question becomes, under the assumption of those already fixed digits $0$, (1) must a non-periodic sequence (of remaining digits) contain arbitrarily long sequences of digits $0$, and (2) do such non-periodic sequences even exist. As you see this is really obvious to answer: (2) yes non-periodic sequences exist (as do irrational numbers), and (1) no, they don't even need to contain any digits $0$, let alone arbitrarily long sequences of such digits.
Start with any irrational number (between $0$ and $1$ for convenience) in ternary expansion and translate the digits after the initial "$0.$" per $0\mapsto 1212$, $1\mapsto 1202$, $2\mapsto 1012$. The the resulting number is also irrational (because nonperiodic) and there are no runs of digits longer than $1$.