Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges.

Terms

a(0) =1a(1) =0a(2) =0a(3) =1a(4) =0a(5) =0a(6) =3a(7) =1a(8) =0a(9) =0a(10) =3a(11) =16a(12) =15a(13) =6a(14) =1a(15) =0a(16) =0a(17) =0a(18) =30a(19) =135a(20) =222a(21) =205a(22) =120a(23) =45a(24) =10a(25) =1a(26) =0a(27) =0a(28) =0a(29) =15