The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A326330 Number of simple graphs with vertices {1..n} whose nesting edges are connected. 8
1, 1, 2, 4, 8, 30, 654 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
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.
LINKS
MATHEMATICA
nesXQ[stn_]:=MatchQ[stn, {___, {x_, y_}, ___, {z_, t_}, ___}/; x<z<t<y||z<x<y<t];
nestcmpts[stn_]:=csm[Union[List/@stn, Select[Subsets[stn, {2}], nesXQ]]];
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]]]]]]]]];
Table[Length[Select[Subsets[Subsets[Range[n], {2}]], Length[nestcmpts[#]]<=1&]], {n, 0, 5}]
CROSSREFS
The covering case is the inverse binomial transform A326331.
Graphs whose crossing edges are connected are A324328.
Sequence in context: A018346 A006398 A053364 * A018355 A100083 A151406
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Jun 27 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 13 10:24 EDT 2024. Contains 373383 sequences. (Running on oeis4.)