Avoiding-sequences with minimum sum (Q1117263)

Let x,n be positive integers with \(x\leq n\). A sequence \(a_ 1,a_ 2,...,a_ n\) of positive integers is called x-avoiding circular sequence of length n if no set of consecutive terms of the sequence \(a_ 1,...,a_ n,a_ 1,...,a_ n\) sums to x. The authors show that if \(a_ 1,...,a_ n\) is an x-avoiding circular sequence of length n then \(a_ 1+...+a_ n\geq 2n\) and give a necessary and sufficient condition for equality. Exact values of \(a_ 1+...+a_ n\) are given for x-avoiding circular sequences of length n for \(x=2,4\), and 6.