Artificial intelligent assistant

Are there infinitely many sets of triples $\{ x,x+1,x+2\}$ that are square free? I suppose there are a series of such questions, depending on the length of the set, staring with pairs, and the power that is supposed to be missing from the divisors. Here is a problem insisting on the opposite; that the numbers should all have a certain power as divisor.

The same question has been asked and answered on MathOverflow:

<

xcX3v84RxoQ-4GxG32940ukFUIEgYdPy 0f014cdffd143bbe95e116919a602631