Regular triangle read by rows where T(n,k) is the number of labeled simple graphs on n vertices where all non-isolated vertices have degree k.

A319729

Regular triangle read by rows where T(n,k) is the number of labeled simple graphs on n vertices where all non-isolated vertices have degree k.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =1a(6) =1a(7) =9a(8) =7a(9) =1a(10) =1a(11) =25a(12) =37a(13) =5a(14) =1a(15) =1a(16) =75a(17) =207a(18) =85a(19) =21a(20) =1a(21) =1a(22) =231a(23) =1347a(24) =525a(25) =591a(26) =7a(27) =1a(28) =1a(29) =763

External references