|
Search: id:A070263
|
|
|
| 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. |
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
0,6
|
|
|
COMMENT
|
For n >= 8 the rows have different beginnings.
|
|
REFERENCES
|
A. Kuedgen, 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 (ralf(AT)ark.in-berlin.de), 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
|
Adjacent sequences: A070260 A070261 A070262 this_sequence A070264 A070265 A070266
Sequence in context: A073164 A134900 A028583 this_sequence A135691 A011317 A087264
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Andre Kundgen (akundgen(AT)csusm.edu), May 09 2002
|
|
|
Search completed in 0.002 seconds
|
