Number T(n,k) of triangle-free graphs on n unlabeled nodes with exactly k connected components; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

A283417

Number T(n,k) of triangle-free graphs on n unlabeled nodes with exactly k connected components; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Terms

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

External references