Number of inequivalent ways to color the edges of a tetrahedron using at most n colors so that no two adjacent edges have the same color.

A282818

Number of inequivalent ways to color the edges of a tetrahedron using at most n colors so that no two adjacent edges have the same color.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =2a(4) =20a(5) =110a(6) =460a(7) =1540a(8) =4312a(9) =10500a(10) =22920a(11) =45870a(12) =85580a(13) =150722a(14) =252980a(15) =407680a(16) =634480a(17) =958120a(18) =1409232a(19) =2025210a(20) =2851140a(21) =3940790a(22) =5357660a(23) =7176092a(24) =9482440a(25) =12376300a(26) =15971800a(27) =20398950a(28) =25805052a(29) =32356170

External references