Number of graphs with loops (symmetric relations) on n unlabeled vertices in which each connected component has an equal number of vertices and edges.

A368984

Number of graphs with loops (symmetric relations) on n unlabeled vertices in which each connected component has an equal number of vertices and edges.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =5a(4) =12a(5) =29a(6) =75a(7) =191a(8) =504a(9) =1339a(10) =3610a(11) =9800a(12) =26881a(13) =74118a(14) =205706a(15) =573514a(16) =1606107a(17) =4513830a(18) =12727944a(19) =35989960a(20) =102026638a(21) =289877828a(22) =825273050a(23) =2353794251a(24) =6724468631a(25) =19239746730a(26) =55123700591a(27) =158133959239a(28) =454168562921

External references