Let G be an abelian group, let S be a sequence of terms s 1 , s 2 , . . . , sn ∈ G not all contained in a coset of a proper subgroup of G, and let W be a sequence of n consecutive integers. Letwhich is a particular kind of weighted restricted sumset. We show that |W ⊙ S| ≥ min{|G| − 1, n}, that W ⊙ S = G if n ≥ |G| + 1, and also characterize all sequences S of length |G| with W ⊙ S = G. This result then allows us to characterize when a linear equationwhere α, a 1 , . . . , ar ∈ Z are given, has a solution (x 1 , . . . , xr) ∈ Z r modulo n with all x i distinct modulo n. As a second simple corollary, we also show that there are maximal length minimal zero-sum sequences over a rank 2 finite abelian group G ∼ = Cn 1 ⊕ Cn 2 (where n 1 | n 2 and n 2 ≥ 3) having k distinct terms, for any k ∈ [3, min{n 1 + 1, exp(G)}]. Indeed, apart from a few simple restrictions, any pattern of multiplicities is realizable for such a maximal length minimal zero-sum sequence.