Triangle T(n,k) read by rows: number of squarefree graphs on n nodes with k components.

Terms

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