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 A172479 #25 Oct 21 2018 13:48:45
%S A172479 1,1,1,1,1,1,1,2,2,1,1,2,4,2,1,1,3,6,6,3,1,1,4,12,12,12,4,1,1,5,20,30,
%T A172479 30,20,5,1,1,6,30,60,90,60,30,6,1,1,8,48,120,240,240,120,48,8,1,1,10,
%U A172479 80,240,600,800,600,240,80,10,1
%N A172479 Triangle read by rows: T(n,k) = A152827(n)/(A152827(k)* A152827(n-k)).
%C A172479 Row sums are 1, 2, 3, 6, 10, 20, 46, 112, 284, 834, 2662, ... .
%H A172479 Donald E. Knuth and Herbert S. Wilf, <a href="http://www.math.upenn.edu/~wilf/website/dm36.pdf">The power of a prime that divides a generalized binomial coefficient</a>, J. Reine Angew. Math., 396:212-219, 1989.
%F A172479 T(n,k) = A152827(n)/(A152827(k)* A152827(n-k)).
%F A172479 T(n,k) = Product_{i=1..n} A000009(i)/(Product_{i=1..k} A000009(i)*Product_{i=1..n-k} A000009(i)).
%e A172479 Triangle begins:
%e A172479 1;
%e A172479 1, 1;
%e A172479 1, 1, 1;
%e A172479 1, 2, 2, 1;
%e A172479 1, 2, 4, 2, 1;
%e A172479 1, 3, 6, 6, 3, 1;
%e A172479 1, 4, 12, 12, 12, 4, 1;
%e A172479 1, 5, 20, 30, 30, 20, 5, 1;
%e A172479 1, 6, 30, 60, 90, 60, 30, 6, 1;
%e A172479 1, 8, 48, 120, 240, 240, 120, 48, 8, 1;
%e A172479 1, 10, 80, 240, 600, 800, 600, 240, 80, 10, 1;
%t A172479 c[n_] := Product[PartitionsQ[m], {m, 1, n}];
%t A172479 t[n_, m_] := c[n]/(c[m]*c[n - m]);
%t A172479 Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}];
%t A172479 Flatten[%]
%Y A172479 Cf. A000009, A152827.
%K A172479 nonn,tabl
%O A172479 0,8
%A A172479 _Roger L. Bagula_, Feb 04 2010
%E A172479 New name and edits by _Tom Edgar_, Jan 23 2015