I assume that in each move, one may flip but doesn't have to. Of course then, we have the case of eight heads as a possible pattern after $k \geq1$ number of moves. If for $k=1$ we choose to flip, there are $\binom{7}{1}=7$ ways to do so(there are $7$ adjacent pairs). For $k=2$ all the $8$ previous patterns are possible, so we only need to add the cases for which one chose to flip both for $k=1$ and $k=2$ and did not flip the same pair back and forth(ending up with eight heads again). So we want to choose two adjacent pairs out of seven, but then discount the choices where the two pairs overlap, which happens when three adjacent coins are "covered" by the two pairs. There are $\binom{7}{2}=21$ ways to choose adjacent pairs, and $\binom{6}{1}=6$ ways to choose overlaps(there are $6$ adjacent triplets), thus we end up with $21-6=15$ new patterns for $k=2$.
For $k=3$,again only considering new patterns, there are $\binom{7}{3}=35$ ways to choose three adjacent pairs. The overlaps can take one out of two forms. One of them is to take two adjacent triplets, where the one closest to the beginning of the row corresponds to two overlapping adjacent pairs, and the other one to one adjacent pair in the last two places. E.g. the two triplets at places $\{1,2,3\}$ and $\{5,6,7\}$ would mean that the pairs are $\{1,2\}$, $\{2,3\}$ and $\{6,7\}$, and two triplets at places $\{1,2,3\}$ and $\{2,3,4\}$ would mean that the pairs are $\{1,2\}$, $\{2,3\}$ and $\{3,4\}$. The other form of overlap consists of two quadruplets, where the one closest to the beginning of the row has one pair in the first two places, and the other quadruplet has two overlapping pairs in the last three places. So e.g. $\{1,2,3,4\}$ and $\{5,6,7,8\}$ would mean that the pairs are $\{1,2\}$, $\{6,7\}$ and $\{7,8\}$, and $\{1,2,3,4\}$ and $\{2,3,4,5\}$ would mean that the pairs are $\{1,2\}$, $\{3,4\}$ and $\{4,5\}$. There are $\binom{6}{2}=15$ ways to choose the triplets and $\binom{5}{2}=10$ ways to choose the quadruplets, thus we end up with $35-15-10=10$ new patterns for $k=3$.
For $k=4$ we only get the all tails case as a possible new one. Thus if $f(k)$ gives the number of possible patterns after move $k$ we have $$f(1)=8, f(2)=23, f(3)=33, f(k)=34, k \geq 4.$$