This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 1
 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, 164, 193, 224, 256, 0, 1, 4, 8, 16, 25, 36, 48, 68, 89, 112, 136, 164, 193, 224, 256, 304, 353 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS For n >= 8 the rows have different beginnings. LINKS A. Kündgen, Minimum average distance subsets in the Hamming cube, Discrete Math., 249 (2002), 149-165. FORMULA 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 EXAMPLE 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,... CROSSREFS Cf. A022560. Sequence in context: A182500 A260189 A208926 * A176912 A245295 A135691 Adjacent sequences:  A070260 A070261 A070262 * A070264 A070265 A070266 KEYWORD nonn,tabf AUTHOR Andre Kundgen (akundgen(AT)csusm.edu), May 09 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 22 02:02 EDT 2019. Contains 325210 sequences. (Running on oeis4.)