The Frobenius Formula for A=(a,ha+d,ha+b2d,...,ha+bkd)A=(a,ha+d,ha+b_2d,...,ha+b_kd)

Given relative prime positive integers $A=(a_1, a_2, ..., a_n)$, the Frobenius number $g(A)$ is the largest integer not representable as a linear combination of the $a_i$'s with nonnegative integer coefficients. We find the ``Stable" property introduced for the square sequence $A=(a,a+1,a+2^2,\dots, a+k^2)$ naturally extends for $A(a)=(a,ha+d,ha+b_2d,...,ha+b_kd)$. This gives a parallel characterization of $g(A(a))$ as a ``congruence class function" modulo $b_k$ when $a$ is large enough. For orderly sequence $B=(1,b_2,\dots,b_k)$, we find good bound for $a$. In particular we calculate $g(a,ha+dB)$ for $B=(1,2,b,b+1,2b)$, $B=(1,b,2b-1)$ and $B=(1,2,...,k,K)$

A Generalization of Mersenne and Thabit Numerical Semigroups

Let $A=(a_1, a_2, ..., a_n)$ be relative prime positive integers with $a_i\geq 2$. The Frobenius number $F(A)$ is the largest integer not belonging to the numerical semigroup $\langle A\rangle$ generated by $A$. The genus $g(A)$ is the number of positive integer elements that are not in $\langle A\rangle$. The Frobenius problem is to find $F(A)$ and $g(A)$ for a given sequence $A$. In this paper, we study the Frobenius problem of $A=(a,2a+d,2^2a+3d,...,2^ka+(2^k-1)d)$ and obtain formulas for $F(A)$ and $g(A)$ when $a+d\geq k$. Our formulas simplifies further for some special cases, such as Mersenne and Thabit numerical semigroups. We obtain explicit formulas for generalized Mersenne and Thabit numerical semigroups and some more general numerical semigroups