A098094 T(n,k) = greatest e such that k^e divides n!, 2<=k<=n (triangle read by rows).

1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 4, 2, 2, 1, 2, 4, 2, 2, 1, 2, 1, 7, 2, 3, 1, 2, 1, 2, 7, 4, 3, 1, 4, 1, 2, 2, 8, 4, 4, 2, 4, 1, 2, 2, 2, 8, 4, 4, 2, 4, 1, 2, 2, 2, 1, 10, 5, 5, 2, 5, 1, 3, 2, 2, 1, 5, 10, 5, 5, 2, 5, 1, 3, 2, 2, 1, 5, 1, 11, 5, 5, 2, 5, 2, 3, 2, 2, 1, 5, 1, 2, 11, 6, 5, 3, 6, 2, 3, 3, 3, 1, 5, 1