Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete tripartite graph using exactly k interchangeable colors, 3 <= k <= 3*n.

A385432

Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete tripartite graph using exactly k interchangeable colors, 3 <= k <= 3*n.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =3a(4) =1a(5) =1a(6) =9a(7) =30a(8) =45a(9) =30a(10) =9a(11) =1a(12) =1a(13) =21a(14) =165a(15) =598a(16) =1032a(17) =939a(18) =471a(19) =129a(20) =18a(21) =1a(22) =1a(23) =45a(24) =750a(25) =5655a(26) =19653a(27) =36465a(28) =39250a(29) =25560

External references