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 consists of a single node or has a unique cycle of length 3.
A144207
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 consists of a single node or has a unique cycle of length 3.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =0a(5) =0a(6) =1a(7) =0a(8) =0a(9) =1a(10) =1a(11) =0a(12) =0a(13) =4a(14) =12a(15) =1a(16) =0a(17) =0a(18) =10a(19) =60a(20) =150a(21) =1a(22) =0a(23) =0a(24) =20a(25) =180a(26) =900a(27) =2160a(28) =1a(29) =0
External references
- oeis: A144207