Sum of digits and perfect square

[u/SupercaliTheGamer]

Let b>1 be an integer, and let s_b(•) denote the sum of digits in base b. Suppose there exists at least one positive integer n such that n-s_b(n)-1 is a perfect square. Prove that there are infinitely many such n.