The shifted sum of the first n values of Euler’s function

In this paper, we prove that, for any given odd number [Formula: see text], the number of integers [Formula: see text] such that [Formula: see text] is a square is [Formula: see text], where [Formula: see text] is the Euler totient function. Beyond this, we pose a conjecture and a problem for further research.