This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A098094 #14 Sep 15 2021 03:29:36
%S A098094 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,
%T A098094 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,
%U A098094 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,2,3
%N A098094 T(n,k) = greatest e such that k^e divides n!, 2<=k<=n (triangle read by rows).
%H A098094 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>.
%F A098094 T(n,2) = A011371(n); T(n,3) = A054861(n) for n>2; T(n,n) = A011776(n).
%e A098094 Array begins:
%e A098094 1
%e A098094 1 1
%e A098094 3 1 1
%e A098094 3 1 1 1
%e A098094 4 2 2 1 2
%e A098094 ...
%t A098094 T[n_, k_] := IntegerExponent[n!, k];
%t A098094 Table[T[n, k], {n, 2, 15}, {k, 2, n}] // Flatten (* _Jean-François Alcover_, Sep 15 2021 *)
%o A098094 (PARI) T(n,k) = valuation(n!, k); \\ _Michel Marcus_, Sep 15 2021
%Y A098094 Cf. A011371, A054861, A011776.
%K A098094 nonn,tabl
%O A098094 2,4
%A A098094 _Reinhard Zumkeller_, Sep 14 2004