A sequence of numbers V = {ν_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V. Dropping two terms from the Fibonacci numbers produces a sequence which is not even weakly complete. However, the sequence F_n^, congruent F_n - (-1)^n is weakly complete, even with any finite subsequence deleted.