On the Frobenius problem for {a,ha + d,ha + bd,ha + b2d,…,ha + bkd}

For positive and relatively prime set of integers A, let Γ(A) denote the set of integers that is formed by taking nonnegative integer linear combinations of integers in A. Then there are finitely many positive integers that do not belong to Γ(A). For A={a,ha+d,ha+bd,ha+b2d,…,ha+bkd}, gcd⁡(a,d)=1, we determine the largest integer g(A) that does not belong to Γ(A), and the number of integers n(A) that does not belong to Γ(A), both for all sufficiently large values of d. This extends a result of Selmer, and corrects a result of Hofmeister, both given in special cases.