A070263 - cp's OEIS frontend

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.

n	a(n)
0	0
1	0
2	1
3	0
4	1
5	4
6	8
7	0
8	1
9	4
10	8
11	16
12	25
13	36
14	48
15	0
16	1
17	4
18	8
19	16
20	25
21	36
22	48
23	68
24	89
25	112
26	136
27	164
28	193
29	224
30	256
31	0
32	1
33	4
34	8
35	16
36	25
37	36
38	48
39	68
40	89
41	112
42	136
43	164
44	193
45	224
46	256
47	304
48	353
49	404
50	456
51	512
52	569
53	628
54	688
55	756
56	825
57	896
58	968
59	1044
60	1121
61	1200
62	1280

[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, 404, 456, 512, 569, 628, 688, 756, 825, 896, 968, 1044, 1121, 1200, 1280]

cp's OEIS Frontend

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.

Table of values

List of values