login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A359509
a(n) is the number of subsets {b_1, b_2, ..., b_t} of {n, n+1, ..., A359506(n)} containing n with the property that b_1 XOR b_2 XOR ... XOR b_t = 0.
0
1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 16, 1, 2, 1, 16, 1, 2, 1, 16, 1, 2, 1, 2048, 1, 2, 1, 16, 1, 2, 1, 2048, 1, 2, 1, 16, 1, 2, 1, 2048, 1, 2, 1, 16, 1, 2, 1, 67108864, 1, 2, 1, 16, 1, 2, 1, 2048, 1, 2, 1, 16, 1, 2, 1, 67108864, 1, 2, 1, 16, 1, 2, 1, 2048, 1, 2, 1
OFFSET
0,6
FORMULA
Conjectured formula: a(n) = 2^A000295(A359508(n)) for n > 0.
CROSSREFS
Sequence in context: A318658 A318512 A295310 * A335665 A369239 A002107
KEYWORD
nonn
AUTHOR
Peter Kagey, Jan 03 2023
STATUS
approved