I would like to know if there is a nice expression for the sum $$ S(n)=\sum_{i+j=n}\binom{3i}{i,i,i}\binom{3j}{j,j,j} $$ where $n$ is a non-negative integer. I have entered in the first few values of $S(n)$ to OEIS and gotten no results.
A similar looking sum which does have a nice expression is $$ T(n)=\sum_{i+j=n}\binom{2i}{i}\binom{2j}{j}=4^n $$ A reference for this is "New developments of an old identity"-Rui Duarte and Antonio Guedes de Oliveira (https://arxiv.org/abs/1203.5424)
I suspect there is no closed form. Using Zeilberger's algorithm, you can show that the minimal recurrence relation with polynomial coefficients satisfied by $S(n)$ is $$ 27(3n+2)(3n+3)(3n+4)S(n)-3(2n+3)(9n^2+27n+22)S(n+1)+(n+2)^3S(n+2)=0 $$ Then, using Petkovšek's algorithm, you can show that this recurrence has no hypergeometric solutions. This means that $S(n)$ has no closed form involving only addition, multiplication, exponentiation with constant base, and the gamma function. I cannot rule out the possibility of a closed form involving expressions like $n^n$, but I have never seen something like that happen before with a summation of products of binomial coefficients.