login
Triangle in which k-th number (0<=k<=n) in n-th row (0<=n) is number of hexads in S(5,6,12) containing k given points and missing n-k given points.
1

%I #11 Feb 03 2022 00:32:52

%S 132,66,66,30,36,30,12,18,18,12,4,8,10,8,4,1,3,5,5,3,1,1,0,3,2,3,0,1

%N Triangle in which k-th number (0<=k<=n) in n-th row (0<=n) is number of hexads in S(5,6,12) containing k given points and missing n-k given points.

%D F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 68.

%D Handbook of Combinatorics, North-Holland '95, p. 720.

%K nonn,tabl,fini,full

%O 0,1

%A _N. J. A. Sloane_