A326251 Number of digraphs with vertices {1..n} whose increasing edges are not crossing.

1, 2, 16, 512, 49152, 11534336, 6039797760, 6768868458496, 15885743998107648, 77083611222073409536, 767126299049285413502976, 15572324598183490228037091328, 642316330843573124053884695740416, 53681919993405760099480940765478125568

Offset: 0

Author

Gus Wiseman, Jun 30 2019

Keywords

• nonn

Comments

A directed edge (a,b) is increasing if a < b. Two edges (a,b), (c,d) are crossing if a < c < b < d or c < a < d < b.

Conjecture: Also the number of non-nesting digraphs with vertices {1..n} whose increasing edges are not crossing, where two edges (a,b), (c,d) are nesting if a < c < d < b or c < a < b < d.

Crossrefs

Simple graphs whose edges are non-crossing are A054726.

Digraphs whose edges are not crossing are A326237.

Digraphs whose increasing edges are crossing are A326252.

Cf. A002416, A229865, A324170, A326209, A326250, A326251.

Programs

Mathematica

croXQ[eds_]:=MatchQ[eds,{_,{x_,y_},_,{z_,t_},_}/;x
				

Formula

a(n) = 2^(n * (n + 1)/2) * A054726(n).