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 A326331 #7 Jun 28 2019 21:14:10
%S A326331 1,0,1,0,1,14,539
%N A326331 Number of simple graphs covering the vertices {1..n} whose nesting edges are connected.
%C A326331 Covering means there are no isolated vertices. Two edges {a,b}, {c,d} are nesting if a < c < d < b or c < a < b < d. A graph has its nesting edges connected if the graph whose vertices are the edges and whose edges are nesting pairs of edges is connected.
%H A326331 Gus Wiseman, <a href="/A326331/a326331.png">The a(5) = 14 simple nesting-connected covering graphs</a>.
%t A326331 nesXQ[stn_]:=MatchQ[stn,{___,{x_,y_},___,{z_,t_},___}/;x<z<t<y||z<x<y<t];
%t A326331 nestcmpts[stn_]:=csm[Union[List/@stn,Select[Subsets[stn,{2}],nesXQ]]];
%t A326331 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 A326331 Table[Length[Select[Subsets[Subsets[Range[n],{2}]],Union@@#==Range[n]&&Length[nestcmpts[#]]<=1&]],{n,0,5}]
%Y A326331 The non-covering case is the binomial transform A326330.
%Y A326331 Covering graphs whose crossing edges are connected are A324327.
%Y A326331 Cf. A006125, A007297, A054726, A099947, A117662, A136653, A324328.
%Y A326331 Cf. A326210, A326293, A326335, A326336, A326337, A326338, A326339.
%K A326331 nonn,more
%O A326331 0,6
%A A326331 _Gus Wiseman_, Jun 27 2019