%I #14 Jun 06 2024 23:57:45
%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,404,456,512,569,628,688,756,825,896,968,1044,1121,1200,1280
%N Triangle T(n,k), n >= 0, 1 <= k <= 2^n, read by rows, giving minimal distancesum 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/S0012365X(01)002424">Minimum average distance subsets in the Hamming cube</a>, Discrete Math., 249 (2002), 149165.
%F Rows seem to converge to expansion of (1/(1x)^2) * Sum_{k>=0} 2^k*t/(1t^2), where 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
%E More terms from _Sean A. Irvine_, Jun 06 2024
