The Frobenius Formula for $A=(a,ha+d,ha+b_{2}d,...,ha+b_{k}d)$

Abstract

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+dB)=(a,ha+d,ha+b_{2}d,...,ha+b_{k}d)$. 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)$, $B=(1,2,b,b+1,2b)$, $B=(1,b,2b-1)$ and $B=(1,2,...,k,K)$. Our idea also applies to the case $B=(b_1,b_2,...,b_k)$, $b_1>1$.

References in corpus (2)

• A Combinatorial Approach to Frobenius Numbers of Some Special Sequences (Complete Version)
• Sylvester sums on the Frobenius set in arithmetic progression with initial gaps

Cited by in corpus (1)

• On Frobenius Numbers of Shifted Power Sequences