Number of inequivalent ways to color the edges of a tetrahedron using at most n colors so that no color appears more than twice.

A282820

Number of inequivalent ways to color the edges of a tetrahedron using at most n colors so that no color appears more than twice.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =9a(4) =132a(5) =720a(6) =2580a(7) =7245a(8) =17304a(9) =36792a(10) =71640a(11) =130185a(12) =223740a(13) =367224a(14) =579852a(15) =885885a(16) =1315440a(17) =1905360a(18) =2700144a(19) =3752937a(20) =5126580a(21) =6894720a(22) =9142980a(23) =11970189a(24) =15489672a(25) =19830600a(26) =25139400a(27) =31581225a(28) =39341484a(29) =48627432

External references