Number of digraphs with vertices {1..n} whose increasing edges are not crossing.
A326251
Number of digraphs with vertices {1..n} whose increasing edges are not crossing.
Terms
- a(0) =1a(1) =2a(2) =16a(3) =512a(4) =49152a(5) =11534336a(6) =6039797760
External references
- oeis: A326251