A177740 - OEIS

%I #8 Sep 08 2022 08:45:53

%S 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,

%T 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,

%U 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

%N 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.

%C The ordering of the partitions is described in A176210.

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

%e 3: 3 (1)

%e 4: 4 (1)

%e 5: 5 (1)

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

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

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

%e so sequence begins 1, 1, 1, 1,2, 1,2, ...

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

%Y The length of the rows is given by A008483.

%Y Cf. A128628 for unrestricted partitions.

%K easy,nonn,tabf

%O 3,5

%A _Jason Kimberley_, May 13 2010

%E Edited (including b-file) by _N. J. A. Sloane_, Oct 05 2010