Program:	PARTISHN
Author:		Rob Gaebler
Date:		1/16/02

Finds the number of partitions of a positive integer N, and special kinds of
partitions.  Partitions of N are the ways to divide up a number into smaller
numbers whose sum is N.  For example, the partitions of 5 are 1+1+1+1+1,
1+1+1+2, 1+1+3, 1+2+2, 1+4, 2+3, and 5.  Thus there are 7 partitions of 5.

The program computes 6 different things:
1: P(N)
The number of partitions of N.

2: P(N) List
The list of P(N) from P(0) up to P(A).

3: P(N, M)
The number of partitions of N into exactly M parts.  For example, there are 2
partitions of 5 into 3 parts: 1+1+3 and 1+2+2. 

4: P(N, M) Matrix
The matrix of P(N, M), as N varies from 0 to A and M varies from 0 to A.

5: All Parts At Least 2
The number of partitions where each part is at least 2.  The number of
partitions of 5 with each part at least 2 is 2 (2+3 and 5).

6: Includes X
The number of partitions of N that contain the number X.  The number of
partitions of 5 containing 2 is 3.

Feel free to contact me with questions or comments at rgaebler@hmc.edu.