(MAGMAMagma) [ #part: part in RestrictedPartitions(n, {3..n}), n in [0..16]];

Edited (including b-file) by _N. J. A. Sloane, _, Oct 05 2010

proposed

approved

editing

proposed

Jason Kimberley (_Jason. Kimberley(AT)newcastle.edu.au), _, May 13 2010

approved

editing

J. S. Kimberley, <a href="/A177740/b177740.txt">Rows 3..39 of A177740 triangle, flattened</a>.

easy,nonn,tabf,new

0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 2, 3, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 3, 1, 2, 2, 2, 2, 3, 3, 3, 4, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 4, 4, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 2, 2, 3, 2, 3, 2, 3, 3, 3, 3, 4, 3, 3, 4, 4, 4, 4, 5

0,6

3,5

J. S. Kimberley, <a href="b177740.txt">Rows 03..39 of A177740 triangle, flattened</a>.

3: 3 (1)

4: 4 (1)

5: 5 (1)

6: 6 or 3,3 (1, 2)

7: 7 or 3,4 (1, 2)

8: 8, 3,5 or 4,4 (1, 2, 2)

so sequence begins 1, 1, 1, 1,2, 1,2, ...

Edited (including b-file) by N. J. A. Sloane, Oct 05 2010

Triangle read by rows in which row n lists the number of parts in each of those partitions of n that have every part >=3.

0, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 2, 2, 3, 1, 2, 2, 2, 3, 1, 2, 2, 2, 3, 3, 1, 2, 2, 2, 2, 3, 3, 3, 4, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 4, 4, 1, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 2, 2, 3, 2, 3, 2, 3, 3, 3, 3, 4, 3, 3, 4, 4, 4, 4, 5

0,6

The ordering of the partitions is described in A176210.

J. S. Kimberley, <a href="b177740.txt">Rows 0..39 of A177740 triangle, flattened</a>.

(MAGMA) [ #part: part in RestrictedPartitions(n, {3..n}), n in [0..16]];

The length of the rows is given by A008483.

Cf. A128628 for unrestricted partitions.

easy,nonn,tabf,new

Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), May 13 2010

approved