I got a reply from the problem author, wanted to post the info here for reference:
Apparently the problem was solved by Pascal Hennequin in his PhD thesis. Chern and Hwang discuss the solution in "Transitional behaviors of the average cost of quicksort with median-of-(2t+1)".
I also found that googling quicksort "2t+1" yields the above paper :).