Triangle T(n,k) of numbers of connected (unicyclic) graphs with unique cycle of length k (3<=k<=n), on n labeled nodes.

A098909

Triangle T(n,k) of numbers of connected (unicyclic) graphs with unique cycle of length k (3<=k<=n), on n labeled nodes.

Terms

    a(0) =1a(1) =12a(2) =3a(3) =150a(4) =60a(5) =12a(6) =2160a(7) =1080a(8) =360a(9) =60a(10) =36015a(11) =20580a(12) =8820a(13) =2520a(14) =360a(15) =688128a(16) =430080a(17) =215040a(18) =80640a(19) =20160a(20) =2520a(21) =14880348a(22) =9920232a(23) =5511240a(24) =2449440a(25) =816480a(26) =181440a(27) =20160a(28) =360000000a(29) =252000000

External references