Triangle read by rows of number of connected graphs with n nodes and k edges (n >= 2, 1 <= k <= n(n-1)/2).
A046751
Triangle read by rows of number of connected graphs with n nodes and k edges (n >= 2, 1 <= k <= n(n-1)/2).
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =0a(5) =0a(6) =2a(7) =2a(8) =1a(9) =1a(10) =0a(11) =0a(12) =0a(13) =3a(14) =5a(15) =5a(16) =4a(17) =2a(18) =1a(19) =1a(20) =0a(21) =0a(22) =0a(23) =0a(24) =6a(25) =13a(26) =19a(27) =22a(28) =20a(29) =14
External references
- oeis: A046751