This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A359509 #5 Jan 12 2023 21:24:30
%S A359509 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,
%T A359509 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,
%U A359509 1,2,1,16,1,2,1,67108864,1,2,1,16,1,2,1,2048,1,2,1
%N 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.
%F A359509 Conjectured formula: a(n) = 2^A000295(A359508(n)) for n > 0.
%Y A359509 Cf. A000295, A359508.
%K A359509 nonn
%O A359509 0,6
%A A359509 _Peter Kagey_, Jan 03 2023