Number of triples of triangles that are pairwise edge-disjoint in the complete graph K_n.

A381863

Number of triples of triangles that are pairwise edge-disjoint in the complete graph K_n.

Terms

    a(0) =120a(1) =1575a(2) =10080a(3) =44380a(4) =154000a(5) =451990a(6) =1170400a(7) =2748460a(8) =5965960a(9) =12137125a(10) =23383360a(11) =43006600a(12) =75988640a(13) =129645740a(14) =214472000a(15) =345209480a(16) =542187800a(17) =832980995a(18) =1254434720a(19) =1855122500a(20) =2698295600a(21) =3865397250a(22) =5460218400a(23) =7613778900a(24) =10490025000

External references