A177740 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.

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

Offset: 3

Author

Jason Kimberley, May 13 2010

Keywords

• easy
• nonn
• tabf

Comments

The ordering of the partitions is described in A176210.

Examples

			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, ...
		

Links

• J. S. Kimberley, Rows 3..39 of A177740 triangle, flattened.

Crossrefs

The length of the rows is given by A008483.

Cf. A128628 for unrestricted partitions.

Programs

Magma

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

Extensions

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