a(n) = 1/(2*n) times the number of n-colorings of the complete tripartite graph K_(k,k,k).

A282247

a(n) = 1/(2*n) times the number of n-colorings of the complete tripartite graph K_(k,k,k).

Terms

    a(0) =0a(1) =0a(2) =1a(3) =66a(4) =9546a(5) =2995540a(6) =1569542955

External references