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 A060539 #34 Jul 28 2023 21:17:32
%S A060539 1,1,2,1,6,3,1,20,15,4,1,70,84,28,5,1,252,495,220,45,6,1,924,3003,
%T A060539 1820,455,66,7,1,3432,18564,15504,4845,816,91,8,1,12870,116280,134596,
%U A060539 53130,10626,1330,120,9,1,48620,735471,1184040,593775,142506,20475,2024,153,10
%N A060539 Table by antidiagonals of number of ways of choosing k items from n*k.
%H A060539 Seiichi Manyama, <a href="/A060539/b060539.txt">Antidiagonals n = 1..140, flattened</a> (first 20 antidiagonals from Harry J. Smith)
%H A060539 H. J. Brothers, <a href="http://www.brotherstechnology.com/docs/Pascal's_Prism_(supplement).pdf">Pascal's Prism: Supplementary Material</a>.
%F A060539 A(n,k) = binomial(n*k,k) = A007318(n*k,k) = A060538(n,k)/A060538(n-1,k).
%e A060539 Square array A(n,k) begins:
%e A060539 1, 1, 1, 1, 1, 1, 1, ...
%e A060539 2, 6, 20, 70, 252, 924, 3432, ...
%e A060539 3, 15, 84, 495, 3003, 18564, 116280, ...
%e A060539 4, 28, 220, 1820, 15504, 134596, 1184040, ...
%e A060539 5, 45, 455, 4845, 53130, 593775, 6724520, ...
%e A060539 6, 66, 816, 10626, 142506, 1947792, 26978328, ...
%e A060539 7, 91, 1330, 20475, 324632, 5245786, 85900584, ...
%p A060539 A:= (n, k)-> binomial(n*k, k):
%p A060539 seq(seq(A(n, 1+d-n), n=1..d), d=1..10); # _Alois P. Heinz_, Jul 28 2023
%o A060539 (PARI) { i=0; for (m=1, 20, for (n=1, m, k=m - n + 1; write("b060539.txt", i++, " ", binomial(n*k, k))); ) } \\ _Harry J. Smith_, Jul 06 2009
%Y A060539 Rows include A000012, A000984, A005809, A005810, A001449, A004355, A004368.
%Y A060539 Columns include A000027, A000384, A006566, A060541.
%Y A060539 Main diagonal is A014062.
%Y A060539 Cf. A295772.
%K A060539 nonn,tabl
%O A060539 1,3
%A A060539 _Henry Bottomley_, Apr 02 2001