Number of digraphs on n unlabeled nodes whose strongly connected components are complete digraphs.

A361583

Number of digraphs on n unlabeled nodes whose strongly connected components are complete digraphs.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =12a(4) =88a(5) =1217a(6) =34672a(7) =2039085a(8) =246005109a(9) =60296886108

External references