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.

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.

Links

Table of n, a(n) for n=0..83.

Formula

a(n) = A359506(n) - n.

Crossrefs

Cf. A092487, A359506.

Sequence in context: A066660 A361687 A057957 * A366660 A241686 A076559

Adjacent sequences: A359504 A359505 A359506 * A359508 A359509 A359510

Keyword

nonn

Author

Peter Kagey, Jan 03 2023

Status

approved