This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A177739 #6 Sep 08 2022 08:45:53
%S A177739 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 A177739 448,544,680,851,1050,1280,1596,1931,2366,2884,3496,4220,5135,6144,
%U A177739 7403,8890,10644,12679,15177,18007,21419,25399,30066,35488,41971,49344,58088
%N A177739 In those partitions of n with every part >=3, the total number of parts (counted with multiplicity).
%C A177739 Also the number of components (counted with multiplicity) of the 2-regular simple graphs of order n.
%t A177739 Table[Length[Flatten[Select[IntegerPartitions[n],Min[#]>2&]]],{n,0,50}] (* _Harvey P. Dale_, May 12 2020 *)
%o A177739 (Magma) [ #&cat RestrictedPartitions(n,{3..n}):n in [0..50]];
%Y A177739 The number of such partitions is given by A008483.
%Y A177739 Lengths of the rows of triangle A176210.
%Y A177739 Row sums of triangle A177740.
%Y A177739 Cf. A006128, A138135.
%K A177739 easy,nonn
%O A177739 0,7
%A A177739 _Jason Kimberley_, May 13 2010