A080804 - cp's OEIS frontend

A080804 Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).

n	a(n)
1	1
2	3
3	4
4	6
5	7
6	8
7	9
8	11
9	12
10	13
11	14
12	15
13	16
14	17
15	18
16	20
17	21
18	22
19	23
20	24
21	25
22	26
23	27
24	28
25	29
26	30
27	31
28	32
29	33
30	34
31	35
32	37
33	38
34	39
35	40
36	41
37	42
38	43
39	44
40	45
41	46
42	47
43	48
44	49
45	50
46	51
47	52
48	53
49	54
50	55
51	56
52	57
53	58
54	59
55	60
56	61
57	62
58	63
59	64
60	65
61	66
62	67
63	68
64	70
65	71
66	72
67	73
68	74
69	75
70	76
71	77
72	78

[1, 3, 4, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 70, 71, 72, 73, 74, 75, 76, 77, 78]

cp's OEIS Frontend

A080804 Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).

Table of values

List of values

n	a(n)
1	1
2	3
3	4
4	6
5	7
6	8
7	9
8	11
9	12
10	13
11	14
12	15
13	16
14	17
15	18
16	20
17	21
18	22
19	23
20	24
21	25
22	26
23	27
24	28
25	29
26	30
27	31
28	32
29	33
30	34
31	35
32	37
33	38
34	39
35	40
36	41
37	42
38	43
39	44
40	45
41	46
42	47
43	48
44	49
45	50
46	51
47	52
48	53
49	54
50	55
51	56
52	57
53	58
54	59
55	60
56	61
57	62
58	63
59	64
60	65
61	66
62	67
63	68
64	70
65	71
66	72
67	73
68	74
69	75
70	76
71	77
72	78

n	a(n)
1	1
2	3
3	4
4	6
5	7
6	8
7	9
8	11
9	12
10	13
11	14
12	15
13	16
14	17
15	18
16	20
17	21
18	22
19	23
20	24
21	25
22	26
23	27
24	28
25	29
26	30
27	31
28	32
29	33
30	34
31	35
32	37
33	38
34	39
35	40
36	41
37	42
38	43
39	44
40	45
41	46
42	47
43	48
44	49
45	50
46	51
47	52
48	53
49	54
50	55
51	56
52	57
53	58
54	59
55	60
56	61
57	62
58	63
59	64
60	65
61	66
62	67
63	68
64	70
65	71
66	72
67	73
68	74
69	75
70	76
71	77
72	78

n	a(n)
1	1
2	3
3	4
4	6
5	7
6	8
7	9
8	11
9	12
10	13
11	14
12	15
13	16
14	17
15	18
16	20
17	21
18	22
19	23
20	24
21	25
22	26
23	27
24	28
25	29
26	30
27	31
28	32
29	33
30	34
31	35
32	37
33	38
34	39
35	40
36	41
37	42
38	43
39	44
40	45
41	46
42	47
43	48
44	49
45	50
46	51
47	52
48	53
49	54
50	55
51	56
52	57
53	58
54	59
55	60
56	61
57	62
58	63
59	64
60	65
61	66
62	67
63	68
64	70
65	71
66	72
67	73
68	74
69	75
70	76
71	77
72	78