The Frobenius problem for shifted square sequences
arXiv:2605.25542
Abstract
The greatest integer that does not belong to a numerical semigroup is called the Frobenius number of , 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.
7 pages