The triangular numbers $T_n$ are defined by $$T_n = \frac{n(n + 1)}{2}.$$
Given a positive integer $d$, how many triangular numbers have exactly $d$ divisors, and how often do such numbers occur?
For $d = 4, 8$ the answer seems to be "infinitely many, and often"; for $d = 6$, it seems to be "infinitely many, but rarely"; and for $d \geq 3$ prime the answer is "none" (I think I can prove this). Given $d$ such that there are infinitely many such triangular numbers, can we say anything about the asymptotic gaps between them?
Here is a plot of the number of divisors of $T_n$ as $n$ ranges from $0$ to $50,000$:
The OEIS contains some sequences related to this question, namely A292989 and A068443, but I can't learn enough from the comments there to settle this question for arbitrary $d$.
Edit: The "none" claim for prime $d$ only holds when $d > 2$, as @BarryCipra pointed out.