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.

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.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =0a(4) =1a(5) =4a(6) =8a(7) =0a(8) =1a(9) =4a(10) =8a(11) =16a(12) =25a(13) =36a(14) =48a(15) =0a(16) =1a(17) =4a(18) =8a(19) =16a(20) =25a(21) =36a(22) =48a(23) =68a(24) =89a(25) =112a(26) =136a(27) =164a(28) =193a(29) =224

External references