Regular triangle where T(n,k) is the number of labeled connected graphs on n + 1 vertices with k maximal blobs (2-connected components).

A317671

Regular triangle where T(n,k) is the number of labeled connected graphs on n + 1 vertices with k maximal blobs (2-connected components).

Terms

    a(0) =1a(1) =1a(2) =3a(3) =10a(4) =12a(5) =16a(6) =238a(7) =215a(8) =150a(9) =125a(10) =11368a(11) =7740a(12) =4140a(13) =2160a(14) =1296a(15) =1014888a(16) =509446a(17) =205065a(18) =84035a(19) =36015a(20) =16807a(21) =166537616a(22) =59409952a(23) =17393152a(24) =5393920a(25) =1863680a(26) =688128a(27) =262144a(28) =50680432112a(29) =12321597708

External references