A Frobenius problem suggested by prime \(k\)-tuplets (Q6041851)

This paper considers a generalization of the Frobenius problem: for a sequence \(({a_1},\dots,{a_e})\) of positive integers with \(\gcd ({a_1},\dots,{a_e}) = 1\) find the greatest integer \(\mathrm{F}({a_1},\dots,{a_e})\) which can not be expressed as a linear combination \({a_1}\mathbb{N} + \dots + {a_e}\mathbb{N}\). For \(\mathrm{F}({a_1},\dots,{a_e})\) a formula has been developed in case \(e = 2\) by Sylvester 1882 (see e.g. \textit{T. Komatsu}, Sylvester sums on the Frobenius set in arithmetic progression with initial gaps, in: P. Debnath (ed.) et al., Advances in number theory and applied analysis. Singapore: World Scientific, 99--136 (2023; Zbl 07707398)]), but it is not possible to find a general polynomial formula in order to compute \(\mathrm{F}({a_1},\dots,{a_e})\) if \(e \ge 3\). In this paper, some second-order polynomial formulas for admissible (prime) triplets and (prime) quadruplets are found.