In this paper, two formulas for calculating the number of partitions of a given length are derived. These formulas are used to prove several theorems about the structure of the generated table of values. Finally, we consider these formulas within the context of computational complexity theory.