OFFSET
0,8
COMMENTS
There are no partitions of 2n+1 into distinct parts whose bitwise XOR equals 0.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..750
Wikipedia, Bitwise operation
Wikipedia, Partition (number theory)
FORMULA
a(n) = A307505(2n,0).
MAPLE
b:= proc(n, i, k) option remember; `if`(i*(i+2)/2<n, 0,
`if`(n=0, `if`(k=0, 1, 0), b(n, i-1, k)+
b(n-i, min(n-i, i-1), Bits[Xor](i, k))))
end:
a:= n-> b(2*n$2, 0):
seq(a(n), n=0..60);
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Alois P. Heinz, Apr 11 2019
STATUS
approved