Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).
A339072
Triangle read by rows: T(n,k) is the number of unlabeled simple 3-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =4a(7) =4a(8) =2a(9) =1a(10) =1a(11) =3a(12) =14a(13) =25a(14) =31a(15) =28a(16) =17a(17) =9a(18) =5a(19) =2a(20) =1a(21) =1a(22) =4a(23) =24a(24) =101a(25) =254a(26) =413a(27) =475a(28) =426a(29) =306
External references
- oeis: A339072