<s>[INST] Numeric sequence Beginning with $2$ and $7$, the sequence $2, 7, 1, 4,7 ,4, 2 , 8,$... is constructed by multiplying successive pairs of its members and adjoining the result as next one or two members of the sequence, depending on whether the product is a one- or a two-digit number. Prove that the digit 6 appears an infinite of times in the sequence.
I kept writing the sequence a few more terms and saw that $6$ will appear a few times, I also thought about which pairs of numbers will generate one, but not as if I assume it will happen forever
 [/INST] (Too long to be a comment)
To slightly demystify how to approach this problem, one idea is to find a never-ending sequence, which then hopefully repeats. There is nothing obvious to do, so let's start naively:
Starting with 2, 7:
2, 7, ...
1, 4, ...
4, ...
At this point, we cannot continue. 
So, let's start with 2, 7, 1:
2, 7, 1, ...
1, 4, 7, ...
4, 2, 8, ...
8, 1, 6, ...
8, 6, ...
4, 8, ...
3, 2, ...
6, ...
At this point, we cannot continue. 
So, let's start with 2, 7, 1, 4:
2, 7, 1, 4, ...
1, 4, 7, 4, ...
4, 2, 8, 2, 8, ...
8, 1, 6, 1, 6, 1, 6, ...
8, 6, 6, 6, ...
4, 8, 3, 6, 3, 6, ...
3, 2, 2, 4, 1, 8, 1, 8, 1, 8, ...
6, 4, 8, 4, 8, 8, 8, 8, 8, ...
2, 4, 3, 2, 3, 2, 3, 2, 6, 4, 6, 4, 6, 4, 6, 4, ...
8, 1, 2, 6, 6, 6, 6, 6, 1, 2, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, ...
8, 2, 1, 2, 3, 6, 3, 6, 3, 6, 3, 6, 6, 2, 4, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, ...   
From here, it follows that once we get that sequence of 8, 8, 8, we get the loop as pointed out by @79037662
</s>