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 A327145 #5 Sep 01 2019 08:40:02
%S A327145 0,1,4,56,4640
%N A327145 Number of connected set-systems with n vertices and at least one bridge (spanning edge-connectivity 1).
%C A327145 A set-system is a finite set of finite nonempty sets. Elements of a set-system are sometimes called edges. The spanning edge-connectivity of a set-system is the minimum number of edges that must be removed (without removing incident vertices) to obtain a disconnected or empty set-system.
%t A327145 csm[s_]:=With[{c=Select[Tuples[Range[Length[s]],2],And[OrderedQ[#],UnsameQ@@#,Length[Intersection@@s[[#]]]>0]&]},If[c=={},s,csm[Sort[Append[Delete[s,List/@c[[1]]],Union@@s[[c[[1]]]]]]]]];
%t A327145 spanEdgeConn[vts_,eds_]:=Length[eds]-Max@@Length/@Select[Subsets[eds],Union@@#!=vts||Length[csm[#]]!=1&];
%t A327145 Table[Length[Select[Subsets[Subsets[Range[n],{1,n}]],spanEdgeConn[Range[n],#]==1&]],{n,0,3}]
%Y A327145 The BII-numbers of these set-systems are A327111.
%Y A327145 Set systems with non-spanning edge-connectivity 1 are A327196, with covering case A327129.
%Y A327145 Set systems with spanning edge-connectivity 2 are A327130.
%Y A327145 Cf. A003465, A323818, A327069, A327071, A327099, A327108, A327144.
%K A327145 nonn,more
%O A327145 0,3
%A A327145 _Gus Wiseman_, Aug 27 2019