The Frobenius problem for shifted square sequences

The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$, and finding the Frobenius number is called the Frobenius problem. In this paper, we resolve the conjecture of Frobenius problem for shifted square sequences suggested by Liu and Xin.