Weakly Complete Sequence
A Sequence of numbers 
is said to be weakly complete if every Positive Integer 
beyond acertain point 
is the sum of some Subsequence of 
(Honsberger 1985). Dropping two terms from theFibonacci Numbers produces a Sequence which is not even weakly complete. However, theSequence
is weakly complete, even with any finite subsequence deleted (Graham 1964).See also Complete Sequence
References
Graham, R. ``A Property of Fibonacci Numbers.'' Fib. Quart. 2, 1-10, 1964. Honsberger, R. Mathematical Gems III. Washington, DC: Math. Assoc. Amer., p. 128, 1985.
- Polyhedral Graph
- Polyhedron
- Polyhedron Coloring
- Polyhedron Compound
- Polyhedron Dissection
- Polyhedron Dual
- Polyhedron Hinging
- Polyhedron Packing
- Polyhex
- Polyiamond
- Polyking
- Polylogarithm
- Polymorph
- Polynomial
- Polynomial Bar Norm
- Polynomial Bracket Norm
- Polynomial Curve
- Polynomial Factor
- Polynomial Norm
- Polynomial Remainder Theorem
- Polynomial Ring
- Polynomial Root
- Polynomial Series
- Polyomino
- Polyomino Tiling