Vtyjkyuk

I'm looking for a clean expression of the following combinatorial sum :

$$sumlimits_k=0^nfracn choose k^22n choose 2k$$
I recall being told it does have a neat expression.

However, I'm not familiar with combinatorics or anything related to evaluating non trivial finite sums such as this, so I basically lack methods to tacke this.

Any insight would be great !

We can simplify it a bit by rearranging the factorials:
$$
fracbinom nk^2binom2n2k = fracfracn!,n!k!,k!,(n-k)!,(n-k)!frac(2n)!(2k)!,(2n-2k)! = fracn!,n!(2n)! cdot frac(2k)!k!,k! cdot frac(2n-2k)!(n-k)!,(n-k)! = fracbinom2kk binom2(n-k)n-kbinom2nn.
$$
So this allows us to factor out a term that does not depend on $n$:
$$
sum_k=0^n fracbinom nk^2binom2n2k = frac1binom2nn sum_k=0^n binom2kkbinom2(n-k)n-k.
$$
The sum that's left simplifies nicely using generating functions, though I'm not aware of a good way to do it that avoids them. If we start with the identity
$$
frac1sqrt1-4x = sum_i ge 0 binom2ii x^i
$$
then we can conclude that the coefficient of $x^n$ in the square of $frac1sqrt1-4x$ is precisely the sum we want: the sum as $k$ goes from $0$ to $n$ represents the coefficient of $x^k$ taken from one factor times the coefficient of $x^n-k$ taken from the other. But the coefficient of $x^n$ in $frac11-4x$ is just $4^n$: it's a geometric series. So we conclude that
$$
sum_k=0^n fracbinom nk^2binom2n2k = frac1binom2nn sum_k=0^n binom2kkbinom2(n-k)n-k = frac4^nbinom2nn.
$$

For first part using the same way of rearranging as @MishaLavrov have done:
$$fracbinom nk^2binom2n2k = fracfracn!,n!k!,k!,(n-k)!,(n-k)!frac(2n)!(2k)!,(2n-2k)! = fracn!,n!(2n)! cdot frac(2k)!k!,k! cdot frac(2n-2k)!(n-k)!,(n-k)! = fracbinom2kk binom2(n-k)n-kbinom2nn.$$

The motivation behind doing this was to get a good form, means to make the denominator constant for a constant $n$, so that dealing with the sum can be made easier. Now, to avoid the way of using generating functions to get the sum, I will use combinatorial argument. Let's concentrate on the sum
$$sum_k=0^n binom2kkbinom2(n-k)n-k$$
Argument:

For specific group, composed of $2n$ people, they'll choose $k$ boys and $(n-k)$ girls. To choose such people, group will be divided to $2k$ people group and $2(n-k)$ people group, each for boy and girl. Find the number of cases satisfying the condition(group composed of same people will be considered the same group no matter to the order).
Then we can do the problem's statement as following: first, choose $k$ boys and $(n-k)$ girls. second, choose $k$ boys dropouts and $n-k$ girls dropouts. Each doesn't interfere other's case so the formula comes out to be $(sum_k=0^n)binomnk)^2$, which is $4^n$.

Hence, our required sum:
$$frac1binom2nn sum_k=0^n binom2kkbinom2(n-k)n-k=frac4^nbinom2nn.$$