|
%I #6 Sep 08 2022 08:45:53
%S 0,0,0,1,1,1,3,3,5,8,10,13,22,25,34,49,62,77,108,132,172,221,276,345,
%T 448,544,680,851,1050,1280,1596,1931,2366,2884,3496,4220,5135,6144,
%U 7403,8890,10644,12679,15177,18007,21419,25399,30066,35488,41971,49344,58088
%N In those partitions of n with every part >=3, the total number of parts (counted with multiplicity).
%C Also the number of components (counted with multiplicity) of the 2-regular simple graphs of order n.
%t Table[Length[Flatten[Select[IntegerPartitions[n],Min[#]>2&]]],{n,0,50}] (* _Harvey P. Dale_, May 12 2020 *)
%o (Magma) [ #&cat RestrictedPartitions(n,{3..n}):n in [0..50]];
%Y The number of such partitions is given by A008483.
%Y Lengths of the rows of triangle A176210.
%Y Row sums of triangle A177740.
%Y Cf. A006128, A138135.
%K easy,nonn
%O 0,7
%A _Jason Kimberley_, May 13 2010
|
