Triangle T(n,k) read by rows: number of bicolored connected graphs with n nodes and k nodes of the first color.

A304311

Triangle T(n,k) read by rows: number of bicolored connected graphs with n nodes and k nodes of the first color.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =2a(7) =3a(8) =3a(9) =2a(10) =6a(11) =11a(12) =16a(13) =11a(14) =6a(15) =21a(16) =58a(17) =98a(18) =98a(19) =58a(20) =21a(21) =112a(22) =407a(23) =879a(24) =1087a(25) =879a(26) =407a(27) =112a(28) =853a(29) =4306

External references