Number of essential graphs with n nodes (in 1-1 correspondence with Markov equivalence classes of acyclic digraphs).

A007984

Number of essential graphs with n nodes (in 1-1 correspondence with Markov equivalence classes of acyclic digraphs).

Terms

    a(0) =1a(1) =2a(2) =11a(3) =185a(4) =8782a(5) =1067825a(6) =312510571a(7) =212133402500

External references