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
It can be verified that slightly further into the sequence you will find $\dots, 8, 2, 8, \dots$
Therefore later in the sequence you will find $\dots, 1, 6, 1, 6\dots$
Therefore later in the sequence you will find $\dots, 6, 6, 6, \dots$
Therefore later in the sequence you will find $\dots, 3, 6, 3, 6, \dots$
Therefore later in the sequence you will find $\dots, 1, 8, 1, 8, 1, 8, \dots$
Therefore later in the sequence you will find $\dots, 8, 8, 8,\dots$
Therefore later in the sequence you will find $\dots, 6, 4, 6, 4,\dots$
Therefore later in the sequence you will find $\dots, 2, 4, 2, 4, 2, 4\dots$
Therefore later in the sequence you will find $\dots, 8, 8, 8\dots$
And so on. The last 3 lines here will continue to occur in the sequence, so $6$ must appear infinitely often.