Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k articulation vertices, (0 <= k <= n).

A325111

Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k articulation vertices, (0 <= k <= n).

Terms

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

External references