Number of labeled digraphs (with self loops allowed) on [n] such that every strongly connected component of size at least 2 contains a vertex with a self loop.

A363834

Number of labeled digraphs (with self loops allowed) on [n] such that every strongly connected component of size at least 2 contains a vertex with a self loop.

Terms

    a(0) =1a(1) =2a(2) =15a(3) =452a(4) =58023a(5) =31083662a(6) =66296957895

External references