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 A070263 #14 Jun 06 2024 23:57:45
%S A070263 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 A070263 164,193,224,256,0,1,4,8,16,25,36,48,68,89,112,136,164,193,224,256,
%U A070263 304,353,404,456,512,569,628,688,756,825,896,968,1044,1121,1200,1280
%N A070263 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 A070263 For n >= 8 the rows have different beginnings.
%H A070263 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 A070263 Rows seem to converge to expansion of (1/(1-x)^2) * Sum_{k>=0} 2^k*t/(1-t^2), where t = x^2^k. - _Ralf Stephan_, Sep 12 2003
%e A070263 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 A070263 Cf. A022560.
%K A070263 nonn,tabf
%O A070263 0,6
%A A070263 Andre Kundgen (akundgen(AT)csusm.edu), May 09 2002
%E A070263 More terms from _Sean A. Irvine_, Jun 06 2024