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

A282819

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

Terms

    a(0) =0a(1) =0a(2) =2a(3) =22a(4) =152a(5) =680a(6) =2270a(7) =6202a(8) =14672a(9) =31152a(10) =60810a(11) =110990a(12) =191752a(13) =316472a(14) =502502a(15) =771890a(16) =1152160a(17) =1677152a(18) =2387922a(19) =3333702a(20) =4572920a(21) =6174280a(22) =8217902a(23) =10796522a(24) =14016752a(25) =18000400a(26) =22885850a(27) =28829502a(28) =36007272a(29) =44616152

External references