Triangle read by rows: T(n,k) is the number of simple connected graphs on n labeled nodes with k articulation vertices, (0 <= k <= n).
A370064
Triangle read by rows: T(n,k) is the number of simple connected graphs on n labeled 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) =3a(8) =0a(9) =0a(10) =10a(11) =16a(12) =12a(13) =0a(14) =0a(15) =238a(16) =250a(17) =180a(18) =60a(19) =0a(20) =0a(21) =11368a(22) =8496a(23) =4560a(24) =1920a(25) =360a(26) =0a(27) =0a(28) =1014888a(29) =540568
External references
- oeis: A370064