Skip to main content
2 of 6
added 198 characters in body
Iosif Pinelis
  • 127.7k
  • 8
  • 107
  • 229

More or less straightforward calculations show that $$E_n=\frac1{(2 n-1)!}\sum _{k=0}^n a_k,$$ where $$a_k:=a_{n,k}:=k! (2 n-k-1)! \binom{2 n-k+1}{k}.$$

This is rather easy to analyze by considering the ratios $a_{k+1}/a_k$, to get $$E_n\asymp\sqrt n,$$ as suggested in the comment by Sam Hopkins (even though I do not understand why this is very close to the birthday problem).

Iosif Pinelis
  • 127.7k
  • 8
  • 107
  • 229