OFFSET
3,1
COMMENTS
Each partition is listed in nonincreasing order.
The partitions in each row are listed in decreasing lexicographic order.
Also the numbers of vertices of the connected components of the 2-regular simple graphs on n vertices.
LINKS
J. S. Kimberley, Rows 3..39 of A176210 triangle, flattened [b-file corrected by N. J. A. Sloane, Oct 05 2010]
EXAMPLE
For n in {0,1,2} there are no parts; so those rows are empty.
3 (one partition only)
4 (one partition only)
5 (one partition only)
6; 3, 3
7; 4, 3
8; 5, 3; 4, 4
9; 6, 3; 5, 4; 3, 3, 3
10; 7, 3; 6, 4; 5, 5; 4, 3, 3
11; 8, 3; 7, 4; 6, 5; 5, 3, 3; 4, 4, 3
12; 9, 3; 8, 4; 7, 5; 6, 6; 6, 3, 3; 5, 4, 3; 4, 4, 4; 3, 3, 3, 3
13; 10, 3; 9, 4; 8, 5; 7, 6; 7, 3, 3; 6, 4, 3; 5, 5, 3; 5, 4, 4; 4, 3, 3, 3
PROG
(Magma) &cat[ &cat RestrictedPartitions(n, {3..n}):n in [1..13]];
KEYWORD
easy,nonn,tabf
AUTHOR
Vladimir Shevelev, Apr 12 2010
EXTENSIONS
Extensively edited by Jason Kimberley, May 13 2010
STATUS
approved