Triangle T(n, k) of the number of connected graphs of order n with cutting number k >= 0.

Terms

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