Triangular array read by rows: T(n,k) is the number of 2-regular labeled graphs on n nodes that have exactly k connected components (cycles); n>=3, 1<=k<=floor(n/3).

A201013

Triangular array read by rows: T(n,k) is the number of 2-regular labeled graphs on n nodes that have exactly k connected components (cycles); n>=3, 1<=k<=floor(n/3).

Terms

    a(0) =1a(1) =3a(2) =12a(3) =60a(4) =10a(5) =360a(6) =105a(7) =2520a(8) =987a(9) =20160a(10) =9576a(11) =280a(12) =181440a(13) =99144a(14) =6300a(15) =1814400a(16) =1104840a(17) =107415a(18) =19958400a(19) =13262040a(20) =1708245a(21) =15400a(22) =239500800a(23) =171119520a(24) =27042444a(25) =600600a(26) =3113510400a(27) =2366076960a(28) =437729292a(29) =16186170

External references