(1) Write a MAPLE program to compute p(n) using the Euler
    recurrence. Use it to compute p(101).
    There is a table of p(n) on pp.238-240 of the text
    so you can check your program.

(2) Use MAPLE to find the generating function for
    p   (n) which is the number of partitions of n into parts
     4,4    less than or equal to 4 in which each part occurs
            at most 4 times.
    Your answer should be a polynomial in q.
    Hence find
    p   (20).
     4,4

(3) (i) Compute the GF of p(D,n) at least up to q^20.
        Hence find p(D,14).
        [HINT: Use the infinite product form of the GF]
    (ii) Verify p(D,n)=p(O,n) for n=14
        by computing the partitions of 14 into distinct parts and
        an the partitions of 14 into odd parts.    
    [HINT: See Example 3 of MAPLE EXAMPLES.]