|
%I #9 Sep 05 2013 09:54:07
%S 0,0,1,0,1,4,8,0,1,4,8,16,25,36,48,0,1,4,8,16,25,36,48,68,89,112,136,
%T 164,193,224,256,0,1,4,8,16,25,36,48,68,89,112,136,164,193,224,256,
%U 304,353
%N Triangle T(n,k), n>=0, 1 <= k <= 2^n, read by rows, giving minimal distance-sum of any set of k binary vectors of length n.
%C For n >= 8 the rows have different beginnings.
%H A. Kündgen, <a href="http://dx.doi.org/10.1016/S0012-365X(01)00242-4">Minimum average distance subsets in the Hamming cube</a>, Discrete Math., 249 (2002), 149-165.
%F Rows seem to converge to expansion of 1/(1-x)^2 * sum(k>=0, 2^kt/(1-t^2), t=x^2^k). - _Ralf Stephan_, Sep 12 2003
%e 0; 0,1; 0,1,4,8; 0,1,4,8,16,25,36,48; 0,1,4,8,16,25,36,48,68,89,112,...
%Y Cf. A022560.
%K nonn,tabf
%O 0,6
%A Andre Kundgen (akundgen(AT)csusm.edu), May 09 2002
|
