Partition Function Q
gives the number of ways of writing the Integer 
as a sum of Positive Integerswithout regard to order with the constraint that all Integers in each sum are distinct. The values for
, 2, ... are 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, ... (Sloane's A000009). The Generating Function for is
The values of
for which is A046065), withno others for 
.The number of Partitions of with 
summands is denoted 
or
. Therefore, 
and
See also Partition Function P
References
Abramowitz, M. and Stegun, C. A. (Eds.). ``Partitions into Distinct Parts.'' §24.2.2 in Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables, 9th printing. New York: Dover, pp. 823-824, 1972. Sloane, N. J. A. SequencesA046065 andA000009/M0281in ``An On-Line Version of the Encyclopedia of Integer Sequences.''http://www.research.att.com/~njas/sequences/eisonline.html and Sloane, N. J. A. and Plouffe, S.The Encyclopedia of Integer Sequences. San Diego: Academic Press, 1995.
- Pascal's Formula
- Pascal's Hexagrammum Mysticum
- Pascal's Limaçon
- Pascal's Rule
- Pascal's Theorem
- Pascal's Triangle
- Pascal's Wager
- Pasch's Axiom
- Pasch's Theorem
- Pass Equivalent
- Pass Move
- Patch
- Path
- Path Graph
- Path Integral
- Pathwise-Connected
- Patriarchal Cross
- Pauli Matrices
- Pauli Spin Matrices
- Payoff Matrix
- P-Circle
- Peacock's Tail
- Peano Arithmetic
- Peano Curve
- Peano-Gosper Curve