312510571domain: NAppears in sequencesNumber of essential graphs with n nodes (in 1-1 correspondence with Markov equivalence classes of acyclic digraphs).at n=6A007984