|
%I #6 Dec 06 2018 16:36:23
%S 0,0,4,71,5927
%N Number of 2-edge-connected clutters spanning n vertices.
%C A clutter is a connected antichain of sets. It is 2-edge-connected if it cannot be disconnected by removing any single edge. Compare to blobs or 2-vertex-connected clutters (A275307).
%e The a(3) = 4 clutters:
%e {{1,3},{2,3}}
%e {{1,2},{2,3}}
%e {{1,2},{1,3}}
%e {{1,2},{1,3},{2,3}}
%Y Cf. A001187, A013922, A030019, A048143, A095983, A275307, A317634, A317635, A317672, A322335, A322393, A322395, A322399.
%K nonn,more
%O 1,3
%A _Gus Wiseman_, Dec 06 2018
|
