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 A077042 #38 Apr 29 2019 20:34:47
%S A077042 1,0,1,0,1,1,0,1,1,1,0,1,2,1,1,0,1,3,3,1,1,0,1,6,7,4,1,1,0,1,10,19,12,
%T A077042 5,1,1,0,1,20,51,44,19,6,1,1,0,1,35,141,155,85,27,7,1,1,0,1,70,393,
%U A077042 580,381,146,37,8,1,1,0,1,126,1107,2128,1751,780,231,48,9,1,1,0,1,252,3139
%N A077042 Square array read by falling antidiagonals of central polynomial coefficients: largest coefficient in expansion of (1 + x + x^2 + ... + x^(n-1))^k = ((1-x^n)/(1-x))^k, i.e., the coefficient of x^floor(k*(n-1)/2) and of x^ceiling(k*(n-1)/2); also number of compositions of floor(k*(n+1)/2) into exactly k positive integers each no more than n.
%C A077042 From _Michel Marcus_, Dec 01 2012: (Start)
%C A077042 A pair of numbers written in base n are said to be comparable if all digits of the first number are at least as big as the corresponding digit of the second number, or vice versa. Otherwise, this pair will be defined as uncomparable. A set of pairwise uncomparable integers will be called anti-hierarchic.
%C A077042 T(n,k) is the size of the maximal anti-hierarchic set of integers written with k digits in base n.
%C A077042 For example, for base n=2 and k=4 digits:
%C A077042 - 0 (0000) and 15 (1111) are comparable, while 6 (0110) and 9 (1001) are uncomparable,
%C A077042 - the maximal antihierarchic set is {3 (0011), 5 (0101), 6 (0110), 9 (1001), 10 (1010), 12 (1100)} with 6 elements that are all pairwise uncomparable. (End)
%H A077042 G. C. Greubel, <a href="/A077042/b077042.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%H A077042 Denis Bouyssou, Thierry Marchant, Marc Pirlot, <a href="https://arxiv.org/abs/1903.07569">The size of the largest antichains in products of linear orders</a>, arXiv:1903.07569 [math.CO], 2019.
%H A077042 J. W. Sander, <a href="https://doi.org/10.1016/0012-365X(93)90515-U">On maximal antihierarchic sets of integers</a>, Discrete Mathematics, Volume 113, Issues 1-3, 5 April 1993, Pages 179-189.
%H A077042 <a href="/index/Com#comp">Index entries for sequences related to compositions</a>
%F A077042 By the central limit theorem, T(n,k) is roughly n^(k-1)*sqrt(6/(Pi*k)).
%F A077042 T(n,k) = Sum{j=0,h/n} (-1)^j*binomial(k,j)*binomial(k-1+h-n*j,k-1) with h=floor(k*(n-1)/2), k>0. - _Michel Marcus_, Dec 01 2012
%e A077042 Rows of square array start:
%e A077042 1, 0, 0, 0, 0, 0, 0, ...
%e A077042 1, 1, 1, 1, 1, 1, 1, ...
%e A077042 1, 1, 2, 3, 6, 10, 20, ...
%e A077042 1, 1, 3, 7, 19, 51, 141, ...
%e A077042 1, 1, 4, 12, 44, 155, 580, ...
%e A077042 1, 1, 5, 19, 85, 381, 1751, ...
%e A077042 ...
%e A077042 Read by antidiagonals:
%e A077042 1;
%e A077042 0, 1;
%e A077042 0, 1, 1;
%e A077042 0, 1, 1, 1;
%e A077042 0, 1, 2, 1, 1;
%e A077042 0, 1, 3, 3, 1, 1;
%e A077042 0, 1, 6, 7, 4, 1, 1;
%e A077042 ...
%t A077042 t[n_, k_] := Max[ CoefficientList[ Series[ ((1-x^n) / (1-x))^k, {x, 0, k*(n-1)}], x]]; t[0, 0] = 1; t[0, _] = 0; Flatten[ Table[ t[n-k, k], {n, 0, 12}, {k, n, 0, -1}]] (* _Jean-François Alcover_, Nov 04 2011 *)
%o A077042 (PARI) T(n,k)=if(n<1 || k<1,k==0,vecmax(Vec(((1-x^n)/(1-x))^k)))
%Y A077042 Rows include A000007, A000012, A001405, A002426, A005190, A005191, A018901, A025012, A025013, A025014, A025015, A201549, A225779, A201550. Columns include A000012, A000012, A001477, A077043, A005900, A077044, A071816, A133458.
%Y A077042 Central diagonal is A077045, with A077046 and A077047 either side. Cf. A067059, A270918, A201552.
%Y A077042 Cf. A273975.
%K A077042 nonn,tabl
%O A077042 0,13
%A A077042 _Henry Bottomley_, Oct 22 2002