Triangle T(n,k) read by rows: the number of connected, loopless, non-oriented, vertex-labeled graphs with n >= 0 edges and k >= 1 vertices, allowing multi-edges.
A290776
Triangle T(n,k) read by rows: the number of connected, loopless, non-oriented, vertex-labeled graphs with n >= 0 edges and k >= 1 vertices, allowing multi-edges.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =3a(6) =0a(7) =1a(8) =7a(9) =16a(10) =0a(11) =1a(12) =12a(13) =63a(14) =125a(15) =0a(16) =1a(17) =18a(18) =162a(19) =722a(20) =1296a(21) =0a(22) =1a(23) =25a(24) =341a(25) =2565a(26) =10140a(27) =16807a(28) =0a(29) =1
External references
- oeis: A290776