Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph has at most one cycle.
A144228
Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph has at most one cycle.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =3a(8) =3a(9) =1a(10) =1a(11) =6a(12) =15a(13) =20a(14) =15a(15) =1a(16) =10a(17) =45a(18) =120a(19) =210a(20) =222a(21) =1a(22) =15a(23) =105a(24) =455a(25) =1365a(26) =2913a(27) =3670a(28) =1a(29) =21
External references
- oeis: A144228