Triangle T(n,k), n>=3, 3<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes, where each maximally connected subgraph consists of a single node or has a unique cycle of length k.
A144212
Triangle T(n,k), n>=3, 3<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes, where each maximally connected subgraph consists of a single node or has a unique cycle of length k.
Terms
- a(0) =2a(1) =17a(2) =4a(3) =221a(4) =76a(5) =13a(6) =3261a(7) =1486a(8) =433a(9) =61a(10) =54801a(11) =29506a(12) =11593a(13) =2941a(14) =361a(15) =1049235a(16) =628531a(17) =296353a(18) =102481a(19) =23041a(20) =2521a(21) =22695027a(22) =14633011a(23) =7795873a(24) =3270961a(25) =1010881a(26) =204121a(27) =20161a(28) =548904831a(29) =373486051
External references
- oeis: A144212