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 A293558 #9 Oct 29 2017 21:34:40
%S A293558 1,3,1,15,5,2,105,35,14,8,1155,385,154,88,48,15015,5005,2002,1144,624,
%T A293558 480,255255,85085,34034,19448,10608,8160,5760,4849845,1616615,646646,
%U A293558 369512,201552,155040,109440,92160
%N A293558 Triangle T(n,k) read by rows: T(n,k) = A005867(k-1)*A002110(n)/A002110(k).
%C A293558 T(n,k) is the triangle in A174909 with reversed row order. (See that sequence for additional comments).
%C A293558 Row sums = A053144(n) = A002110(n) - T(n+1,n+1).
%C A293558 T(n,k) = number of terms with smallest prime factor prime(k) contained in primorial(n) consecutive numbers, k <= n. For example, T(5,4) = 88, so there are 88 terms with smallest prime factor 7 in any sequence of 2310 consecutive numbers.
%e A293558 Triangle starts:
%e A293558 n/k 1 2 3 4 5 6
%e A293558 1 1
%e A293558 2 3 1
%e A293558 3 15 5 2
%e A293558 4 105 35 14 8
%e A293558 5 1155 385 154 88 48
%e A293558 6 15015 5005 2002 1144 624 480
%e A293558 T(5,3) = 154: A005867(2) = 2, A002110(5) = 2310, A002110(3) = 30; 2*2310/30 = 154.
%t A293558 Table[#1 Product[EulerPhi@ Prime@ i, {i, k - 1}]/#2 & @@ Map[Product[ Prime@ i, {i, #}] &, {n, k}], {n, 8}, {k, n}] // Flatten (* _Michael De Vlieger_, Oct 12 2017 *)
%Y A293558 Cf. A000040 (prime numbers), A002110, A005867, A053144, A174909 (this triangle with reversed row order).
%K A293558 nonn,tabl
%O A293558 1,2
%A A293558 _Bob Selcoe_, Oct 11 2017