Is there any recurrence relation known for the number of reduced words of the longest element in $S_n$ (not commutation classes)?