Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-connected graphs with n nodes and k edges (n >= 4, ceiling(3*n/2) <= k <= n*(n-1)/2).
A339069
Triangle read by rows: T(n,k) is the number of unlabeled simple series-reduced 2-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) =4a(6) =5a(7) =4a(8) =2a(9) =1a(10) =1a(11) =4a(12) =17a(13) =30a(14) =34a(15) =29a(16) =17a(17) =9a(18) =5a(19) =2a(20) =1a(21) =1a(22) =5a(23) =33a(24) =133a(25) =307a(26) =464a(27) =505a(28) =438a(29) =310
External references
- oeis: A339069