A student has asked for a program that, given an integer n such as 6, prints out 
on successive lines all decompositions of n into addends with sum n, so that
the addends on a line never grow when read from left to right. For example, for
n = 6, we print out

	6
	5  1  
	4  2  
	4  1  1  
	3  3  
	3  2  1  
	3  1  1  1  
	2  2  2  
	2  2  1  1  
	2  1  1  1  1  
	1  1  1  1  1  1  

Here is a solution, written as a class with operations for printing out
a decomposition and for computing the next decomposition.