By "fixed," I just mean, say, observing $k$ consecutive 6s when tossing a fair die.
The latter case has the solution $E[N] = \frac{6^k - 1}{5}$, shown Expected number of rolls until a number appears $k$ consecutive times, and the former has a solution $E[N_{fixed}] = \frac{6(6^k - 1)}{5}$.
Could someone provide intuition how to go from one to the other? I think there should be a very easy transition from one to the other but it's not obvious to me what it is, but there's definitely some strong symmetry in the problem.
I also imagine the factor of $6$ generalizes to an $n$-sided die, where the factor will become $n$.
So I figured this out, but I definitely want to learn about other viewpoints.
Here's what I came up with.
Let $g,f$ denote the events that we have $k$ consecutive 6s and $k$ consecutive ANY number, respectively. Suppose $f$ occurs. It has a $1/6$ probability that it is the event $g$, i.e. $f=g$. There is thus a $5/6$ probability that $f \neq g$. In this case, we have effectively started over in our request to get to event $g$, so to get form $f$ to $g$, we require $g$ tosses, on average. And note that $g$ is a subset of $f$. So if we have that $g$ has occured, then $f$ has occured as well.
So we have
$$ E[N_{fixed}] = 1/6(E[N] + 0) + 5/6(E[N] + E[N_{fixed}]) \\ \implies E[N_{fixed}] = 6E[N] $$
The combinatorial argument is that you throw until you get $k$ consecutive of any type; if that is of the number you want then stop, and if not then start again.
So if $A$ is the expected number of throws until you get $k$ consecutive of any type and $B$ is the expected number of throws until you get $k$ consecutive of the type you want then $$B=A +\frac1n 0+ \frac{n-1}{n}B$$ implying $$B = nA$$ and here $n=6$