login
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.
1
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
OFFSET
0,2
COMMENTS
Conjecture: a(n) is of the form 2^k + 1 for all n > 0.
FORMULA
a(n) = A359506(n) - n.
CROSSREFS
Sequence in context: A066660 A361687 A057957 * A366660 A241686 A076559
KEYWORD
nonn
AUTHOR
Peter Kagey, Jan 03 2023
STATUS
approved