Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.

A201922

Triangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =6a(7) =3a(8) =1a(9) =1a(10) =21a(11) =8a(12) =3a(13) =1a(14) =1a(15) =112a(16) =30a(17) =9a(18) =3a(19) =1a(20) =1a(21) =853a(22) =145a(23) =32a(24) =9a(25) =3a(26) =1a(27) =1a(28) =11117a(29) =1028

External references