Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum \begin{ equation*} \sum_{ n \leq x} D(n + s(n)), \end{ equation*} where \begin{ equation*} D(n) = \frac{ \tau(n)}{ 2^{ \omega(n)}}. \end{ equation*} Here, $\tau(n)$ denotes the number of positive divisors of $n$, and $\omega(n)$ stands for the number of distinct prime factors of $n$.
Categories: math.NT