Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1).
A259862
Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =5a(7) =3a(8) =2a(9) =1a(10) =13a(11) =11a(12) =7a(13) =2a(14) =1a(15) =44a(16) =56a(17) =39a(18) =13a(19) =3a(20) =1a(21) =191a(22) =385a(23) =332a(24) =111a(25) =21a(26) =3a(27) =1a(28) =1229a(29) =3994
External references
- oeis: A259862