A359507 - cp's OEIS frontend

A359507 a(n) is the least integer k such that there exists a strictly increasing integer sequence n = b_1 < b_2 < ... < b_t = n + k with the property that b_1 XOR b_2 XOR ... XOR b_t = 0.

n	a(n)
0	0
1	2
2	3
3	3
4	3
5	5
6	3
7	5
8	3
9	5
10	3
11	9
12	3
13	5
14	3
15	9
16	3
17	5
18	3
19	9
20	3
21	5
22	3
23	17
24	3
25	5
26	3
27	9
28	3
29	5
30	3
31	17
32	3
33	5
34	3
35	9
36	3
37	5
38	3
39	17
40	3
41	5
42	3
43	9
44	3
45	5
46	3
47	33
48	3
49	5
50	3
51	9
52	3
53	5
54	3
55	17
56	3
57	5
58	3
59	9
60	3
61	5
62	3
63	33
64	3
65	5
66	3
67	9
68	3
69	5
70	3
71	17
72	3
73	5
74	3
75	9
76	3
77	5
78	3
79	33
80	3
81	5
82	3
83	9
84	3
85	5
86	3
87	17
88	3
89	5
90	3
91	9
92	3
93	5
94	3
95	65
96	3
97	5
98	3
99	9
100	3
101	5

[0, 2, 3, 3, 3, 5, 3, 5, 3, 5, 3, 9, 3, 5, 3, 9, 3, 5, 3, 9, 3, 5, 3, 17, 3, 5, 3, 9, 3, 5, 3, 17, 3, 5, 3, 9, 3, 5, 3, 17, 3, 5, 3, 9, 3, 5, 3, 33, 3, 5, 3, 9, 3, 5, 3, 17, 3, 5, 3, 9, 3, 5, 3, 33, 3, 5, 3, 9, 3, 5, 3, 17, 3, 5, 3, 9, 3, 5, 3, 33, 3, 5, 3, 9, 3, 5, 3, 17, 3, 5, 3, 9, 3, 5, 3, 65, 3, 5, 3, 9, 3, 5]

cp's OEIS Frontend

A359507 a(n) is the least integer k such that there exists a strictly increasing integer sequence n = b_1 < b_2 < ... < b_t = n + k with the property that b_1 XOR b_2 XOR ... XOR b_t = 0.

Table of values

List of values

n	a(n)
0	0
1	2
2	3
3	3
4	3
5	5
6	3
7	5
8	3
9	5
10	3
11	9
12	3
13	5
14	3
15	9
16	3
17	5
18	3
19	9
20	3
21	5
22	3
23	17
24	3
25	5
26	3
27	9
28	3
29	5
30	3
31	17
32	3
33	5
34	3
35	9
36	3
37	5
38	3
39	17
40	3
41	5
42	3
43	9
44	3
45	5
46	3
47	33
48	3
49	5
50	3
51	9
52	3
53	5
54	3
55	17
56	3
57	5
58	3
59	9
60	3
61	5
62	3
63	33
64	3
65	5
66	3
67	9
68	3
69	5
70	3
71	17
72	3
73	5
74	3
75	9
76	3
77	5
78	3
79	33
80	3
81	5
82	3
83	9
84	3
85	5
86	3
87	17
88	3
89	5
90	3
91	9
92	3
93	5
94	3
95	65
96	3
97	5
98	3
99	9
100	3
101	5

n	a(n)
0	0
1	2
2	3
3	3
4	3
5	5
6	3
7	5
8	3
9	5
10	3
11	9
12	3
13	5
14	3
15	9
16	3
17	5
18	3
19	9
20	3
21	5
22	3
23	17
24	3
25	5
26	3
27	9
28	3
29	5
30	3
31	17
32	3
33	5
34	3
35	9
36	3
37	5
38	3
39	17
40	3
41	5
42	3
43	9
44	3
45	5
46	3
47	33
48	3
49	5
50	3
51	9
52	3
53	5
54	3
55	17
56	3
57	5
58	3
59	9
60	3
61	5
62	3
63	33
64	3
65	5
66	3
67	9
68	3
69	5
70	3
71	17
72	3
73	5
74	3
75	9
76	3
77	5
78	3
79	33
80	3
81	5
82	3
83	9
84	3
85	5
86	3
87	17
88	3
89	5
90	3
91	9
92	3
93	5
94	3
95	65
96	3
97	5
98	3
99	9
100	3
101	5

n	a(n)
0	0
1	2
2	3
3	3
4	3
5	5
6	3
7	5
8	3
9	5
10	3
11	9
12	3
13	5
14	3
15	9
16	3
17	5
18	3
19	9
20	3
21	5
22	3
23	17
24	3
25	5
26	3
27	9
28	3
29	5
30	3
31	17
32	3
33	5
34	3
35	9
36	3
37	5
38	3
39	17
40	3
41	5
42	3
43	9
44	3
45	5
46	3
47	33
48	3
49	5
50	3
51	9
52	3
53	5
54	3
55	17
56	3
57	5
58	3
59	9
60	3
61	5
62	3
63	33
64	3
65	5
66	3
67	9
68	3
69	5
70	3
71	17
72	3
73	5
74	3
75	9
76	3
77	5
78	3
79	33
80	3
81	5
82	3
83	9
84	3
85	5
86	3
87	17
88	3
89	5
90	3
91	9
92	3
93	5
94	3
95	65
96	3
97	5
98	3
99	9
100	3
101	5