A078882 - cp's OEIS frontend

A078882 Number of subsets S of {1,2,3,...,n} with the largest possible cardinality consistent with the requirement that if i and j are distinct elements of S then i XOR j is not in S. XOR is the bitwise exclusive-OR operator.

n	a(n)
1	1
2	1
3	3
4	3
5	1
6	3
7	7
8	7
9	3
10	1
11	1
12	1
13	3
14	7
15	15
16	15
17	7
18	3
19	3
20	1
21	1
22	1
23	1
24	1
25	1
26	1
27	3
28	3
29	7
30	15
31	31
32	31
33	15
34	7
35	7
36	3
37	3
38	3
39	3
40	1
41	1
42	1

[1, 1, 3, 3, 1, 3, 7, 7, 3, 1, 1, 1, 3, 7, 15, 15, 7, 3, 3, 1, 1, 1, 1, 1, 1, 1, 3, 3, 7, 15, 31, 31, 15, 7, 7, 3, 3, 3, 3, 1, 1, 1]